NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS
From MaRDI portal
Publication:5173288
DOI10.1142/S0129054114400103zbMath1320.68110MaRDI QIDQ5173288
Daniel Goč, Alexandros Palioudakis, Kai Salomaa
Publication date: 9 February 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Descriptional and computational complexity of finite automata -- a survey
- Finite automata and unary languages
- Intersection and union of regular languages and state complexity
- Regularity-preserving relations
- The state complexities of some basic operations on regular languages
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Minimal NFA Problems are Hard
- On pseudo‐polynomials
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
This page was built for publication: NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS
