scientific article; zbMATH DE number 4020506

zbMATH Open0627.68069MaRDI QIDQ3763607FDOQ3763607

Authors: Jean-Éric Pin 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

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)

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
• Title not available (Why is that?)
• Logics for reversible regular languages and semigroups with involution
• On the simulation of quantum Turing machines.
• An axiomatic approach to reversible computation
• Title not available (Why is that?)
• Polynomial closure of group languages and open sets of the Hall topology
• Closure under reversal of languages over infinite alphabets
• Reversible computing from a programming language perspective
• On the complexity of computing the profinite closure of a rational language
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Small size quantum automata recognizing some regular languages
• Some formal tools for analyzing quantum automata.
• Title not available (Why is that?)
• Topologies for the free monoid
• A hierarchy of fast reversible Turing machines
• Quantum finite automata with control language
• An axiomatic theory for reversible computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the k-reversibility of finite automata
• Decision problems for reversible and permutation automata
• Rational subsets of partially reversible monoids
• Title not available (Why is that?)
• 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)