The Membership Problem for Linear and Regular Permutation Languages

DOI10.1007/978-3-319-22360-5_18zbMath1423.68261OpenAlexW1650921749MaRDI QIDQ2947424

Grzegorz Madejski

Publication date: 23 September 2015

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Regular and linear permutation languages ⋮ On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness

This page was built for publication: The Membership Problem for Linear and Regular Permutation Languages