Exact enumeration of acyclic deterministic automata
DOI10.1016/J.DAM.2005.06.009zbMATH Open1090.68060DBLPjournals/dam/Liskovets06OpenAlexW2056679539WikidataQ60692131 ScholiaQ60692131MaRDI QIDQ2489949FDOQ2489949
Authors: Valery A. Liskovets 
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.06.009
Recommendations
Dead stateEnumerative injection methodInitially connected automatonMinimal automaton recognizing a finite languageQuasi-acyclic automaton
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Title not available (Why is that?)
- The asymptotic number of acyclic digraphs. II
- On the shape of a random acyclic digraph
- On the Number of Maximal Vertices of a Random Acyclic Digraph
- Title not available (Why is that?)
- Minimisation of acyclic deterministic automata in linear time
- Enumeration of Linear Graphs for Mappings of Finite Sets
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
- Direct construction of minimal acyclic finite states automata
- Pseudo-minimal transducer
Cited In (21)
- EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
- Asymptotic enumeration of minimal automata
- Compacted binary trees admit a stretched exponential
- Asymptotic enumeration of compacted binary trees of bounded right height
- Counting extensional acyclic digraphs
- Enumeration and generation with a string automata representation
- Title not available (Why is that?)
- Sampling different kinds of acyclic automata using Markov chains
- Succinct representations for (non)deterministic finite automata
- Enumeration of minimal acyclic automata via generalized parking functions
- The method of forced enumeration for nondeterministic automata
- A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- Minimisation of acyclic deterministic automata in linear time
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
- Random generation of deterministic acyclic automata using Markov chains
- Title not available (Why is that?)
- An algorithm for enumerating all infinite repetitions in a D0L-system
- Enumerating regular expressions and their languages
- Succinct representation for (non)deterministic finite automata
- Enumerated BSP Automata
Uses Software
This page was built for publication: Exact enumeration of acyclic deterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489949)
