Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton

DOI10.1007/978-3-319-19225-3_23zbMath1432.68246OpenAlexW2403327439MaRDI QIDQ5500699

Hellis Tamm

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited ⋮ Unnamed Item ⋮ Yet another canonical nondeterministic automaton

Cites Work

• Theory of átomata
• Canonical Nondeterministic Automata
• Theory of Átomata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton