Complexity of Problems of Commutative Grammars
From MaRDI portal
Publication:5246714
DOI10.2168/LMCS-11(1:9)2015zbMath1395.68172arXiv1501.04245OpenAlexW3100227670MaRDI QIDQ5246714
Publication date: 22 April 2015
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.04245
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Context-free commutative grammars with integer counters and resets ⋮ Problems on finite automata and the exponential time hypothesis ⋮ State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ Operational State Complexity and Decidability of Jumping Finite Automata ⋮ Automata for unordered trees ⋮ Problems on Finite Automata and the Exponential Time Hypothesis ⋮ Counting problems for parikh images ⋮ Decidability of Right One-Way Jumping Finite Automata ⋮ Characterization and complexity results on jumping finite automata
This page was built for publication: Complexity of Problems of Commutative Grammars
