Remarks about commutative context-free languages

DOI10.1006/jcss.1997.1553zbMath0914.68119OpenAlexW2076753878MaRDI QIDQ1267720

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)

Related Items (2)

ON PARTITIONS SEPARATING WORDS ⋮ Characterization and complexity results on jumping finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• On commutative context-free languages
• Cônes rationnels commutatifs
• A result concerning the trios generated by commutative SLIP-languages
• The solution of a problem by Ginsburg
• The conjecture of Fliess on commutative context-free languages
• Every commutative quasirational language is regular
• On Context-Free Languages
• On permuting letters of words in context-free languages

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