On commutative context-free languages

DOI10.1016/0022-0000(87)90018-3zbMath0627.68063OpenAlexW1963791535MaRDI QIDQ1092674

Joffroy Beauquier, Michel Latteux, Meera Blattner

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90018-3

zbMATH Keywords

Fliess conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Rational languages and the Burnside problem ⋮ Sur les ensembles linéaires ⋮ Remarks about commutative context-free languages ⋮ ON PARTITIONS SEPARATING WORDS ⋮ Characterization and complexity results on jumping finite automata

Cites Work

• The solution of a problem by Ginsburg
• On Context-Free Languages
• On permuting letters of words in context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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