Yet another canonical nondeterministic automaton

DOI10.1016/J.TCS.2024.114581MaRDI QIDQ6499548

Hendrik Maarand, Hellis Tamm

Publication date: 8 May 2024

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

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
• Bideterministic automata and minimal representations of regular languages
• 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
• Minimal NFA and biRFSA Languages
• 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