Star-free trace languages

DOI10.1016/0304-3975(92)90080-YzbMath0769.68062MaRDI QIDQ1193878

Sergio Salemi, Antonio Restivo, Giovanna Guaiana

Publication date: 27 September 1992

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

zbMATH Keywords

commutative monoidsaperiodic trace languagesstar-free trace languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Some decisional problems on rational relations, Topology for Computations of Concurrent Automata, On aperiodic and star-free formal power series in partially commuting variables, Petri net languages and infinite subsets of \(\mathbb{N}^m\), A kleene theorem for recognizable languages over concurrency monoids, Recognizable languages in concurrency monoids, A note on the commutative closure of star-free languages, Logical definability on infinite traces, From local to global temporal logics over Mazurkiewicz traces., Unnamed Item, Local testability from words to traces, a suitable definition, The Shuffle Product: New Research Directions, Representation of computations in concurrent automata by dependence orders, RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular trace languages
• Theory of traces
• Combinatorics on traces
• Variétés de langages et opérations
• Membership problems for regular and context-free trace languages
• Recognizable subsets of some partially Abelian monoids
• Combinatorial problems of commutation and rearrangements
• Dot-depth of star-free events
• On finite monoids having only trivial subgroups
• A Note on Star-Free Events