scientific article; zbMATH DE number 4020506

MaRDI QIDQ3763607zbMATH OpenFDO

Authors Jean-Éric Pin

Publication date 1987

zbMATH Keywords

regular languagedecidabilityKleene's theoremrational languagetopological descriptionfinite-group topology of the free monoidlanguages accepted by a reversible automatonsubsets of the free group

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• A lower bound for reversible automata
• scientific article; zbMATH DE number 2086620
• Minimal and Reduced Reversible Automata
• Minimal and reduced reversible automata
• Reversible languages having finitely many reduced automata

Cited in

(35)

• Reversibility of computations in graph-walking automata
• On locally reversible languages
• On the efficient construction of quasi-reversible automata for reversible languages
• Logics for reversible regular languages and semigroups with involution
• scientific article; zbMATH DE number 3943060 (Why is no real title available?)
• On the simulation of quantum Turing machines.
• An axiomatic approach to reversible computation
• scientific article; zbMATH DE number 2086620 (Why is no real title available?)
• Polynomial closure of group languages and open sets of the Hall topology
• Closure under reversal of languages over infinite alphabets
• On the complexity of computing the profinite closure of a rational language
• Reversible computing from a programming language perspective
• scientific article; zbMATH DE number 6292604 (Why is no real title available?)
• Polynomial closure of group languages and open sets of the Hall topology
• On the Size of One-way Quantum Finite Automata with Periodic Behaviors
• Varieties Generated by Certain Models of Reversible Finite Automata
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• Quantum automata for some multiperiodic languages
• Small size quantum automata recognizing some regular languages
• Some formal tools for analyzing quantum automata.
• scientific article; zbMATH DE number 1948499 (Why is no real title available?)
• Topologies for the free monoid
• scientific article; zbMATH DE number 3858418 (Why is no real title available?)
• A hierarchy of fast reversible Turing machines
• Quantum finite automata with control language
• scientific article; zbMATH DE number 3864507 (Why is no real title available?)
• scientific article; zbMATH DE number 1408339 (Why is no real title available?)
• An axiomatic theory for reversible computation
• On the k-reversibility of finite automata
• Rational subsets of partially reversible monoids
• Decision problems for reversible and permutation automata
• scientific article; zbMATH DE number 1088283 (Why is no real title available?)
• Reversible regular languages: logical and algebraic characterisations
• Learning approximately regular languages with reversible languages
• Identification of function distinguishable languages.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763607)