Remarks about commutative context-free languages

DOI10.1006/JCSS.1997.1553MaRDI QIDQ1267720zbMATH OpenOpenAlexFDO

Authors Juha Kortelainen

Publication date 13 October 1998

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/aee360b654bb2ce1d44f3d6d5e33a82bf071e111

zbMATH Keywords

commutative language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On commutative context-free languages
• On the commutative equivalence of context-free languages
• A note on context-free languages
• Partially-commutative context-free languages
• The conjecture of Fliess on commutative context-free languages
• On the commutative equivalence of bounded context-free and regular languages
• scientific article; zbMATH DE number 3393744
• scientific article; zbMATH DE number 2162119
• A note on the commutative closure of star-free languages
• scientific article; zbMATH DE number 871238

Cites work

• scientific article; zbMATH DE number 3121282 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• A result concerning the trios generated by commutative SLIP-languages
• Cônes rationnels commutatifs
• Every commutative quasirational language is regular
• On Context-Free Languages
• On commutative context-free languages
• On permuting letters of words in context-free languages
• The conjecture of Fliess on commutative context-free languages
• The solution of a problem by Ginsburg

Cited in

(12)

• scientific article; zbMATH DE number 3845857 (Why is no real title available?)
• ON PARTITIONS SEPARATING WORDS
• \(O_n\) is an \(n\)-MCFL
• On commutative context-free languages
• scientific article; zbMATH DE number 4001505 (Why is no real title available?)
• Commutative languages and their composition by consensual methods
• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• Partially-commutative context-free languages
• scientific article; zbMATH DE number 3393744 (Why is no real title available?)
• The conjecture of Fliess on commutative context-free languages
• The commutative closure of a binary slip-language is context-free: A new proof.
• Characterization and complexity results on jumping finite automata

This page was built for publication: Remarks about commutative context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267720)