scientific article; zbMATH DE number 2086620

MaRDI QIDQ4737155zbMATH OpenFDO

Authors Sylvain Lombardy

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800170.htm

zbMATH Keywords

finite automatareversible automatareversible languagesuniversal automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the efficient construction of quasi-reversible automata for reversible languages
• scientific article; zbMATH DE number 4020506
• Reversible languages having finitely many reduced automata
• Concise representations of reversible automata
• Concise representations of reversible automata
• On bounded languages and reversal-bounded automata
• On bounded languages and reversal-bounded automata
• Logic of reversible automata
• On the k-reversibility of finite automata
• scientific article; zbMATH DE number 3864507

Cited in

(26)

• On locally reversible languages
• Reversible pushdown automata
• Descriptional complexity of regular languages
• Quotients and atoms of reversible languages
• Reversibility of computations in graph-walking automata
• Concise representations of reversible automata
• A lower bound for reversible automata
• Reversible and irreversible computations of deterministic finite-state devices
• When input-driven pushdown automata meet reversiblity
• Quantum reversible fuzzy grammars
• scientific article; zbMATH DE number 3858418 (Why is no real title available?)
• scientific article; zbMATH DE number 3864507 (Why is no real title available?)
• scientific article; zbMATH DE number 4020506 (Why is no real title available?)
• Bisimulations for fuzzy automata
• Minimal reversible deterministic finite automata
• scientific article; zbMATH DE number 1870550 (Why is no real title available?)
• Reversible languages having finitely many reduced automata
• scientific article; zbMATH DE number 7444007 (Why is no real title available?)
• Concise representations of reversible automata
• Automata with Reversal-Bounded Counters: A Survey
• Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
• Quotients and Atoms of Reversible Languages
• Introducing VAUCANSON
• Reversible weighted automata over finite rings and monoids with commuting idempotents
• Nondeterministic automata: equivalence, bisimulations, and uniform relations
• On the efficient construction of quasi-reversible automata for reversible 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 Q4737155)