EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
From MaRDI portal
Publication:3526533
Recommendations
- A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
- scientific article; zbMATH DE number 2081054
- Direct construction of minimal acyclic finite states automata
- Exact enumeration of acyclic deterministic automata
- scientific article; zbMATH DE number 2050934
- Minimisation of acyclic deterministic automata in linear time
- Incremental Construction of Minimal Acyclic Finite-State Automata
- scientific article; zbMATH DE number 6300100
- Minimizing deterministic lattice automata
- Minimizing deterministic lattice automata
Cites work
- scientific article; zbMATH DE number 5605090 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- Enumeration and generation with a string automata representation
- Exact enumeration of acyclic deterministic automata
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
Cited in
(7)- Enumeration and generation with a string automata representation
- Sampling different kinds of acyclic automata using Markov chains
- A new algorithm for the construction of minimal acyclic DFAs.
- Enumeration of minimal acyclic automata via generalized parking functions
- Random generation of deterministic acyclic automata using Markov chains
- Forward injective finite automata: exact and random generation of nonisomorphic NFAs
- Block languages and their bitmap representations
This page was built for publication: EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526533)
