scientific article; zbMATH DE number 1747444
From MaRDI portal
Publication:4531373
Recommendations
Cited in
(23)- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- State complexity of some operations on binary regular languages
- Descriptional complexity of regular languages
- Computational complexity of problems for deterministic presentations of sofic shifts
- Language operations with regular expressions of polynomial size
- State complexity of combined operations
- State complexity of Kleene-star operations on trees
- Remarks on multiple entry deterministic finite automata
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Descriptional and Computational Complexity of Finite Automata
- Converting Self-verifying Automata into Deterministic Automata
- The tractability frontier for NFA minimization
- Extremal minimality conditions on automata
- A Finite State Version of the Kraft--McMillan Theorem
- State trade-offs in unranked tree automata
- Descriptional and computational complexity of finite automata -- a survey
- Optimal simulation of self-verifying automata by deterministic automata
- Decision problems for reversible and permutation automata
- Classical and quantum Merlin-Arthur automata
- A hierarchy of reversible finite automata
- Multi-entry DFA with reduced initial states to speedup parallel recognition
- Minimizing finite automata is computationally hard
- Language equations with complementation: decision problems
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 Q4531373)
