On (left) partial shuffle

DOI10.1007/3-540-58131-6_52zbMath1529.68145OpenAlexW1485569410MaRDI QIDQ6183610

Alexandru Mateescu

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58131-6_52

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Commutative one-counter languages are regular
• Extending regular expressions with iterated shuffle
• A calculus of communicating systems
• Process algebra for synchronous communication
• Shuffle Relations and Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item