Regular and linear permutation languages

DOI10.1051/ITA/2018016MaRDI QIDQ5223617zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

closure propertiescontext-free grammarsdecidabilitygenerative powerinterchange ruleslinear grammarspermutation languagesregular grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• ON A HIERARCHY OF PERMUTATION LANGUAGES
• Infinite hierarchy of permutation languages
• The membership problem for linear and regular permutation languages
• On permutative grammars generating context-free languages
• On the membership problem of permutation grammars -- a direct proof of NP-completeness

Cites work

• Characterization and complexity results on jumping finite automata
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• 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)

• On permutative grammars generating context-free languages
• The membership problem for linear and regular permutation languages
• Languages generated by context-free grammars extended by type \(AB\to BA\) rules
• ON A HIERARCHY OF PERMUTATION LANGUAGES
• Combinatorial generation via permutation languages
• Infinite hierarchy of permutation languages
• On the membership problem of permutation grammars -- a direct proof of NP-completeness
• Permutation rewriting and algorithmic verification

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)