Yet another canonical nondeterministic automaton
From MaRDI portal
Publication:6499548
DOI10.1016/J.TCS.2024.114581MaRDI QIDQ6499548FDOQ6499548
Authors: Hendrik Maarand, Hellis Tamm 
Publication date: 8 May 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Learning regular sets from queries and counterexamples
- The universal automaton
- Title not available (Why is that?)
- Theory of átomata
- Complexity of atoms, combinatorially
- Title not available (Why is that?)
- On the State Minimization of Nondeterministic Finite Automata
- Intersection and union of regular languages and state complexity
- Linear Automaton Transformations
- Coalgebraic constructions of canonical nondeterministic automata
- Bideterministic automata and minimal representations of regular languages
- 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.
- Generalization of the double-reversal method of finding a canonical residual finite state automaton
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)
