Pages that link to "Item:Q388216"
From MaRDI portal
The following pages link to Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216):
Displaying 7 items.
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- (Q5016357) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
