Quotients and atoms of reversible languages

DOI10.1016/j.tcs.2022.02.023OpenAlexW4212879448MaRDI QIDQ2139050

Hellis Tamm

Publication date: 17 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.023

zbMATH Keywords

regular languageleft quotientreversible automatonatom of regular language

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bideterministic automata and minimal representations of regular languages
• On the efficient construction of quasi-reversible automata for reversible languages
• Reversible nondeterministic finite automata
• Theory of átomata
• A Lower Bound For Reversible Automata
• ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
• Inference of Reversible Languages
• THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
• New Interpretation and Generalization of the Kameda-Weiner Method.
• The Degree of Irreversibility in Deterministic Finite Automata
• Minimal Reversible Deterministic Finite Automata
• Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited
• Complexity of atoms, combinatorially

This page was built for publication: Quotients and atoms of reversible languages