There is no complete axiom system for shuffle expressions

DOI10.1051/ita:1999117zbMath0951.68066OpenAlexW1995677455WikidataQ114011382 ScholiaQ114011382MaRDI QIDQ4718894

Andrzej Szepietowski

Publication date: 4 January 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_1999__33_3_271_0/

zbMATH Keywords

shuffle expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The universe problem for unrestricted flow languages
• Complete systems of \(\mathcal B\)-rational identities
• Axiomatizing shuffle and concatenation in languages