State complexity of partial word finite automata
From MaRDI portal
No records found.
Cites work
- A lower bound technique for the size of nondeterministic finite automata
- Algorithmic Combinatorics on Partial Words
- Explicit bounds for some functions of prime numbers.
- Finite automata and unary languages
- Handbuch der Lehre von der Verteilung der Primzahlen. Erster Band.
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- Minimal partial languages and automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- On measuring nondeterminism in regular languages
- On the Computational Complexity of Partial Word Automata Problems
- On the maximal order in S_n and S*_n
- On the state complexity of partial word DFAs
- Partial words and a theorem of Fine and Wilf
- Regular languages of partial words
- State complexity of partial word finite automata
- Sur l'ordre maximum d'un élément dans le groupe S_n des permutations
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Über die Maximalordnung der Permutationen gegebenen Grades.
This page was built for publication: State complexity of partial word finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316812)
