Mixed product and asynchronous automata

DOI10.1016/0304-3975(86)90094-0zbMath0638.68095OpenAlexW1967959761MaRDI QIDQ1099643

Christine Duboc

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90094-0

zbMATH Keywords

tracesasynchronous automatafree partially commutative monoidstrace languagesalphabetic morphismmixed product of automatasynchronous products

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (13)

Asynchronous automata versus asynchronous cellular automata ⋮ Two techniques in the area of the star problem in trace monoids ⋮ Net models of discrete information transducers. I ⋮ Subclasses of recognizable trace languages ⋮ Semi-trace morphisms and rational transductions ⋮ Notes on finite asynchronous automata ⋮ A Theory of Formal Choreographic Languages ⋮ Hopf algebras and identities in free partially commutative monoids ⋮ Asynchronous trace-matching automata ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ Mixed languages ⋮ Semi-commutations and Petri nets ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on the representation of trace monoids
• Langages infinitaires et produit de mixage
• Maximal serializability of iterated transactions
• On some equations in free partially commutative monoids
• Recognizable subsets of some partially Abelian monoids
• Combinatorial problems of commutation and rearrangements
• Trace languages defined by regular string languages
• The serializability of concurrent database updates

This page was built for publication: Mixed product and asynchronous automata