scientific article; zbMATH DE number 2182418
From MaRDI portal
Publication:3022285
Recommendations
- Tight bounds for NFA to DFCA transformations for binary alphabets
- More on deterministic and nondeterministic finite cover automata
- More on deterministic and nondeterministic finite cover automata (extended abstract)
- scientific article; zbMATH DE number 1156489
- On minimizing cover automata for finite languages in O(n n) time
Cited in
(9)- More on deterministic and nondeterministic finite cover automata
- More on deterministic and nondeterministic finite cover automata (extended abstract)
- The number of similarity relations and the number of minimal deterministic finite cover automata
- A comparative study on three MAP factor estimate approaches for NFA
- Tight bounds for NFA to DFCA transformations for binary alphabets
- Lower bound for converting an NFA with finite nondeterminism into an MDFA
- COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES
- scientific article; zbMATH DE number 5181726 (Why is no real title available?)
- Incremental construction of minimal deterministic finite cover automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022285)