Deterministic automata. Simulation, universality and minimality

DOI10.1016/S0168-0072(97)00039-0zbMath0890.68084OpenAlexW2076526965MaRDI QIDQ1377610

Bakhadyr Khoussainov, Elena Calude, Cristian S. Calude

Publication date: 11 June 1998

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(97)00039-0

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational methods for problems pertaining to quantum theory (81-08)

Related Items (7)

Derivatives of Regular Expressions and an Application ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Computational complementarity and shift spaces ⋮ Final and sequential behaviours of M-automata ⋮ Cayley Automatic Groups and Numerical Characteristics of Turing Transducers ⋮ Decision Problems for Finite Automata over Infinite Algebraic Structures ⋮ Finite nondeterministic automata: simulation and minimality

Cites Work

• Computational complementarity
• Automata simulating quantum logics
• Physical versus computational complementarity. I
• Automaton partition logic versus quantum logic
• Automaton logic
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• State-identification experiments in finite automata
• On the Bound to the Memory of a Sequential Machine
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic automata. Simulation, universality and minimality