scientific article
From MaRDI portal
Publication:3763607
zbMath0627.68069MaRDI QIDQ3763607
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilityregular languagetopological descriptionKleene's theoremrational languagefinite-group topology of the free monoidlanguages accepted by a reversible automatonsubsets of the free group
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)
Related Items
Polynomial closure of group languages and open sets of the Hall topology ⋮ On the Size of One-way Quantum Finite Automata with Periodic Behaviors ⋮ Polynomial closure of group languages and open sets of the Hall topology ⋮ Identification of function distinguishable languages. ⋮ On the simulation of quantum Turing machines. ⋮ An axiomatic approach to reversible computation ⋮ Reversible computing from a programming language perspective ⋮ Reversibility of computations in graph-walking automata ⋮ Topologies for the free monoid ⋮ Quantum automata for some multiperiodic languages ⋮ On the efficient construction of quasi-reversible automata for reversible languages ⋮ Small size quantum automata recognizing some regular languages ⋮ Some formal tools for analyzing quantum automata. ⋮ On the complexity of computing the profinite closure of a rational language ⋮ Learning approximately regular languages with reversible languages ⋮ A Hierarchy of Fast Reversible Turing Machines ⋮ On locally reversible languages ⋮ Quantum finite automata with control language ⋮ Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
