Pages that link to "Item:Q5246714"
From MaRDI portal
The following pages link to Complexity of Problems of Commutative Grammars (Q5246714):
Displayed 9 items.
- Automata for unordered trees (Q515668) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- Counting problems for parikh images (Q5111226) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- Decidability of Right One-Way Jumping Finite Automata (Q5859648) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)