Synchronization expressions with extended join operation

DOI10.1016/S0304-3975(98)00056-5zbMath0912.68108OpenAlexW2030769844MaRDI QIDQ1274985

Kai Salomaa, Sheng Yu

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00056-5

zbMATH Keywords

regular expressionsrewriting systemssemi-commutationsynchronization languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Related Items

STATE COMPLEXITY AND APPROXIMATION, Synchronization languages and rewriting systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for concurrency: Towards a classification
• Recognizable languages in concurrency monoids
• Petri nets and bisimulation
• A process algebraic view of input/output automata
• Semi-commutations
• Thue systems as rewriting systems
• Theory of traces
• Representation of computations in concurrent automata by dependence orders
• Rational and recognizable complex trace languages
• Synchronization languages and rewriting systems
• On confluence of one-rule trace-rewriting systems