Regular and linear permutation languages
From MaRDI portal
Publication:5223617
DOI10.1051/ITA/2018016zbMATH Open1429.68125OpenAlexW2914480740WikidataQ128427963 ScholiaQ128427963MaRDI QIDQ5223617FDOQ5223617
Authors: Grzegorz Madejski 
Publication date: 18 July 2019
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2018016
Recommendations
context-free grammarsdecidabilityclosure propertiesgenerative powerregular grammarslinear grammarspermutation languagesinterchange rules
Cites Work
- Reversal-bounded multipushdown machines
- Title not available (Why is that?)
- Languages generated by context-free grammars extended by type \(AB\to BA\) rules
- ON A HIERARCHY OF PERMUTATION LANGUAGES
- Partially-commutative context-free languages
- Infinite hierarchy of permutation languages
- Characterization and complexity results on jumping finite automata
- Jumping finite automata
- The membership problem for linear and regular permutation languages
- Pumping lemmas for linear and nonlinear context-free languages
- Jumping grammars
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
- ON A HIERARCHY OF PERMUTATION LANGUAGES
- The membership problem for linear and regular 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)
