On a structural property in the state complexity of projected regular languages
From MaRDI portal
Publication:443744
DOI10.1016/J.TCS.2012.04.009zbMATH Open1276.68093OpenAlexW1964746886MaRDI QIDQ443744FDOQ443744
Authors: 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
Recommendations
Cites Work
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- Compositional verification in supervisory control
- Introduction to Discrete Event Systems
- Title not available (Why is that?)
- Control of distributed systems: tutorial and overview
- Descriptional complexity -- an introductory survey
- Magic numbers in the state hierarchy of finite automata
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- Coordination control of distributed discrete-event systems
- Title not available (Why is that?)
- 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
- Complexity in union-free regular languages
- The magic number problem for subregular language families
- Magic numbers and ternary alphabet
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Title not available (Why is that?)
- State complexity of projected languages
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
- Title not available (Why is that?)
- On the computation of natural observers in discrete-event systems
Cited In (14)
- Natural projection as partial model checking
- State complexity of projection on languages recognized by permutation automata and commuting letters
- Comparing the notions of opacity for discrete-event systems
- On properties and state complexity of deterministic state-partition automata
- State complexity of binary coded regular languages
- State complexity of binary coded regular languages
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- On States Observability in Deterministic Finite Automata
- State complexity of projected languages
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- Empirical studies in the size of diagnosers and verifiers for diagnosability analysis
- Verifying weak and strong \(k\)-step opacity in discrete-event systems
- On the state complexity of operations on two-way finite automata
- Commutative regular languages with product-form minimal automata
Uses Software
This page was built for publication: On a structural property in the state complexity of projected regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443744)
