On a structural property in the state complexity of projected regular languages
From MaRDI portal
Publication:443744
Recommendations
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 1834665 (Why is no real title available?)
- scientific article; zbMATH DE number 3269886 (Why is no real title available?)
- scientific article; zbMATH DE number 3305070 (Why is no real title available?)
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Complexity in union-free regular languages
- Compositional verification in supervisory control
- Control of distributed systems: tutorial and overview
- Coordination control of distributed discrete-event systems
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Descriptional complexity -- an introductory survey
- Determination of finite automata accepting subregular languages
- Introduction to Discrete Event Systems
- Magic numbers and ternary alphabet
- 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
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- On the computation of natural observers in discrete-event systems
- State complexity of projected languages
- Supervisory control synthesis of discrete-event systems using a coordination scheme
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
- The magic number problem for subregular language families
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
Cited in
(14)- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- Commutative regular languages with product-form minimal automata
- Verifying weak and strong \(k\)-step opacity in discrete-event systems
- State complexity of projection on languages recognized by permutation automata and commuting letters
- Natural projection as partial model checking
- Comparing the notions of opacity for discrete-event systems
- On properties and state complexity of deterministic state-partition automata
- Empirical studies in the size of diagnosers and verifiers for diagnosability analysis
- State complexity of projected languages
- On States Observability in Deterministic Finite Automata
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- State complexity of binary coded regular languages
- On the state complexity of operations on two-way finite automata
- State complexity of binary coded regular languages
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)
