scientific article; zbMATH DE number 2068873
From MaRDI portal
Publication:4465333
Recommendations
Cited in
(30)- State complexity of power
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).
- Compacted binary trees admit a stretched exponential
- On the number of active states in finite automata
- Enumerating regular expressions and their languages
- Succinct representation for (non)deterministic finite automata
- Succinct representations for (non)deterministic finite automata
- More on deterministic and nondeterministic finite cover automata
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- Enumeration and generation with a string automata representation
- On the average state and transition complexity of finite languages
- Exact enumeration of acyclic deterministic automata
- Minimizing nfa's and regular expressions
- The k-distinct language: parameterized automata constructions
- More on deterministic and nondeterministic finite cover automata (extended abstract)
- The state complexity of random DFAs
- Automata recognizing no words: a statistical approach
- State complexity of cyclic shift
- Compact Normal Form for Regular Languages as Xor Automata
- Learning finite automata using label queries
- scientific article; zbMATH DE number 3956447 (Why is no real title available?)
- scientific article; zbMATH DE number 176770 (Why is no real title available?)
- scientific article; zbMATH DE number 1948499 (Why is no real title available?)
- A large deviations principle for the Maki-Thompson rumour model
- Semicomputable points in Euclidean spaces
- On the asymptotic enumeration of accessible automata
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
- The \(k\)-distinct language: parameterized automata constructions
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages
- Enumeration and random generation of accessible 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 Q4465333)
