Pages that link to "Item:Q443744"
From MaRDI portal
The following pages link to On a structural property in the state complexity of projected regular languages (Q443744):
Displayed 10 items.
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- Empirical studies in the size of diagnosers and verifiers for diagnosability analysis (Q1686857) (← links)
- Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- State complexity of binary coded regular languages (Q2112182) (← links)
- Natural projection as partial model checking (Q2208303) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- State complexity of binary coded regular languages (Q6120344) (← links)
- Verifying weak and strong \(k\)-step opacity in discrete-event systems (Q6165326) (← links)