Pages that link to "Item:Q2465047"
From MaRDI portal
The following pages link to Transition complexity of language operations (Q2465047):
Displayed 7 items.
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- STATE COMPLEXITY AND APPROXIMATION (Q4902894) (← links)