Finite nondeterministic automata: simulation and minimality

DOI10.1016/S0304-3975(98)00221-7zbMath0944.68098WikidataQ127489004 ScholiaQ127489004MaRDI QIDQ1575547

Elena Calude, Bakhadyr Khoussainov, Cristian S. Calude

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

finite automatanondeterministic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

Bisimulations for fuzzy automata, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Minimization algorithm of fuzzy finite automata., Construction of fuzzy automata from fuzzy regular expressions, Fuzzy relation equations and reduction of fuzzy automata, Reduction of fuzzy automata by means of fuzzy quasi-orders, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, Cayley Automatic Groups and Numerical Characteristics of Turing Transducers, Decision Problems for Finite Automata over Infinite Algebraic Structures, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complementarity
• Automata simulating quantum logics
• Regular component splittable languages
• Physical versus computational complementarity. I
• Deterministic automata. Simulation, universality and minimality
• Automaton partition logic versus quantum logic
• Automaton logic
• On the Bound to the Memory of a Sequential Machine