A Lower Bound For Reversible Automata

DOI10.1051/ita:2000120zbMath0987.68043OpenAlexW2092883162MaRDI QIDQ2720406

Pierre-Cyrille Héam

Publication date: 26 June 2001

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2000__34_5_331_0/

zbMATH Keywords

finite automatonreversible automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (8)

Quotients and atoms of reversible languages ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Minimal Reversible Deterministic Finite Automata ⋮ Reversibility of computations in graph-walking automata ⋮ On the efficient construction of quasi-reversible automata for reversible languages ⋮ On locally reversible languages ⋮ Descriptional complexity of regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• Topologies for the free monoid
• Finite state automata: A geometric approach
• On free inverse monoid languages
• Inference of Reversible Languages
• Inverse Monoids, Trees, and Context-Free Languages
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• Monoid kernels and profinite topologies on the free Abelian group
• Extending partial automorphisms and the profinite topology on free groups
• A topology for free groups and related groups

This page was built for publication: A Lower Bound For Reversible Automata