Yet another canonical nondeterministic automaton

DOI10.1016/J.TCS.2024.114581MaRDI QIDQ6499548zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 1886068 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• Bideterministic automata and minimal representations of regular languages
• Coalgebraic constructions of canonical nondeterministic automata
• Complexity of atoms, combinatorially
• Generalization of the double-reversal method of finding a canonical residual finite state automaton
• Intersection and union of regular languages and state complexity
• Learning regular sets from queries and counterexamples
• Linear Automaton Transformations
• Lower bound methods for the size of nondeterministic finite automata revisited
• Minimal NFA and biRFSA Languages
• New Interpretation and Generalization of the Kameda-Weiner Method.
• On the State Minimization of Nondeterministic Finite Automata
• The universal automaton
• Theory of átomata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499548)