Pages that link to "Item:Q5496197"
From MaRDI portal
The following pages link to Operational State Complexity under Parikh Equivalence (Q5496197):
Displaying 15 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- Nondeterministic right one-way jumping finite automata (Q2113381) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (Q3167503) (← links)
- (Q5016357) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- The State Complexity of Permutations on Finite Languages over Binary Alphabets (Q5500695) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- Jumping automata over Infinite words (Q6088920) (← links)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)
- Jumping automata over infinite words (Q6661761) (← links)