On a structural property in the state complexity of projected regular languages
From MaRDI portal
Publication:443744
DOI10.1016/j.tcs.2012.04.009zbMath1276.68093MaRDI QIDQ443744
Galina Jirásková, Tomáš Masopust
Publication date: 13 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.009
68Q45: Formal languages and automata
Related Items
On the state complexity of operations on two-way finite automata, Empirical studies in the size of diagnosers and verifiers for diagnosability analysis, On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
- Control of distributed systems: tutorial and overview
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- Supervisory control synthesis of discrete-event systems using a coordination scheme
- Determination of finite automata accepting subregular languages
- Magic numbers in the state hierarchy of finite automata
- COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES
- MAGIC NUMBERS AND TERNARY ALPHABET
- Introduction to Discrete Event Systems
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Compositional Verification in Supervisory Control
- State Complexity of Projected Languages
- Coordination Control of Distributed Discrete-Event Systems
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the computation of natural observers in discrete-event systems
