Mixed product and asynchronous automata
DOI10.1016/0304-3975(86)90094-0zbMATH Open0638.68095OpenAlexW1967959761MaRDI QIDQ1099643FDOQ1099643
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
Recommendations
- Notes on finite asynchronous automata
- An extension of the notions of traces and of asynchronous automata
- scientific article; zbMATH DE number 1015097
- scientific article; zbMATH DE number 554484
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
tracesasynchronous automatatrace languagesfree partially commutative monoidsalphabetic morphismmixed product of automatasynchronous products
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Recognizable subsets of some partially Abelian monoids
- Title not available (Why is that?)
- The serializability of concurrent database updates
- Combinatorial problems of commutation and rearrangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some equations in free partially commutative monoids
- A remark on the representation of trace monoids
- Maximal serializability of iterated transactions
- Langages infinitaires et produit de mixage
- Trace languages defined by regular string languages
Cited In (17)
- The star problem and the finite power property in trace monoids: Reductions beyond C4
- Hopf algebras and identities in free partially commutative monoids
- Notes on finite asynchronous automata
- Semi-trace morphisms and rational transductions
- An extension of the notions of traces and of asynchronous automata
- Title not available (Why is that?)
- Two techniques in the area of the star problem in trace monoids
- A Theory of Formal Choreographic Languages
- Net models of discrete information transducers. I
- Title not available (Why is that?)
- Asynchronous automata versus asynchronous cellular automata
- Asynchronous trace-matching automata
- Subclasses of recognizable trace languages
- Mixed languages
- Semi-commutations and Petri nets
- Semantics of Deterministic Shared-Memory Systems
- Title not available (Why is that?)
This page was built for publication: Mixed product and asynchronous automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099643)
