Yet another canonical nondeterministic automaton

DOI10.1007/978-3-031-13257-5_14OpenAlexW4299919650MaRDI QIDQ2112192

Hellis Tamm, Hendrik Maarand

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_14

zbMATH Keywords

regular languageautomata learningatoms of regular languagescanonical automaton

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coalgebraic constructions of canonical nondeterministic automata
• Learning regular sets from queries and counterexamples
• Intersection and union of regular languages and state complexity
• Theory of átomata
• Linear Automaton Transformations
• New Interpretation and Generalization of the Kameda-Weiner Method.
• Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton
• On the State Minimization of Nondeterministic Finite Automata
• Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited
• Complexity of atoms, combinatorially

This page was built for publication: Yet another canonical nondeterministic automaton