State Complexity of Projected Languages
From MaRDI portal
Publication:5200092
DOI10.1007/978-3-642-22600-7_16zbMath1341.68096OpenAlexW88413339MaRDI QIDQ5200092
Tomáš Masopust, Galina Jirásková
Publication date: 29 July 2011
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_16
Related Items
On conditional decomposability ⋮ Quantitative estimates for the size of an intersection of sparse automatic sets ⋮ On a structural property in the state complexity of projected regular languages ⋮ More on the descriptional complexity of products of finite automata
Uses Software
Cites Work
- Finite automata and unary languages
- 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
- Magic numbers in the state hierarchy of finite automata
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES
- 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
- Magic Numbers and Ternary Alphabet
- Modular Control of Discrete-Event Systems With Coalgebra
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
