Publication:3763607
From MaRDI portal
zbMath0627.68069MaRDI QIDQ3763607
Publication date: 1987
decidability; regular language; topological description; Kleene's theorem; rational language; finite-group topology of the free monoid; languages accepted by a reversible automaton; subsets of the free group
68Q45: Formal languages and automata
20M05: Free semigroups, generators and relations, word problems
Related Items
On the Size of One-way Quantum Finite Automata with Periodic Behaviors, On the complexity of computing the profinite closure of a rational language, On the efficient construction of quasi-reversible automata for reversible languages, On locally reversible languages, Topologies for the free monoid, Learning approximately regular languages with reversible languages, Polynomial closure of group languages and open sets of the Hall topology, Identification of function distinguishable languages., On the simulation of quantum Turing machines., Quantum automata for some multiperiodic languages, Small size quantum automata recognizing some regular languages, Some formal tools for analyzing quantum automata., A Hierarchy of Fast Reversible Turing Machines, Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata, Quantum finite automata with control language
