Regular and linear permutation languages
From MaRDI portal
Publication:5223617
Recommendations
Cites work
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Characterization and complexity results on jumping finite automata
- Infinite hierarchy of permutation languages
- Jumping finite automata
- Jumping grammars
- Languages generated by context-free grammars extended by type \(AB\to BA\) rules
- ON A HIERARCHY OF PERMUTATION LANGUAGES
- Partially-commutative context-free languages
- Pumping lemmas for linear and nonlinear context-free languages
- Reversal-bounded multipushdown machines
- The membership problem for linear and regular permutation languages
Cited in
(8)- Permutation rewriting and algorithmic verification
- On the membership problem of permutation grammars -- a direct proof of NP-completeness
- Languages generated by context-free grammars extended by type \(AB\to BA\) rules
- Infinite hierarchy of permutation languages
- Combinatorial generation via permutation languages
- On permutative grammars generating context-free languages
- The membership problem for linear and regular permutation languages
- ON A HIERARCHY OF PERMUTATION LANGUAGES
This page was built for publication: Regular and linear permutation languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223617)