Star-free trace languages

DOI10.1016/0304-3975(92)90080-YMaRDI QIDQ1193878zbMATH OpenFDO

Authors Giovanna Guaiana, Antonio Restivo, Sergio Salemi

Publication date 27 September 1992

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

Full work available at URL https://doi.org/10.1016/0304-3975(92)90080-Y

zbMATH Keywords

aperiodic trace languagescommutative monoidsstar-free trace languages

Mathematics Subject Classification ID

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

Cites work

• A Note on Star-Free Events
• Combinatorial problems of commutation and rearrangements
• Combinatorics on traces
• Dot-depth of star-free events
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 176495 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3526592 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• Membership problems for regular and context-free trace languages
• On finite monoids having only trivial subgroups
• On regular trace languages
• Recognizable subsets of some partially Abelian monoids
• Theory of traces
• Variétés de langages et opérations

Cited in

(17)

• Representation of computations in concurrent automata by dependence orders
• Some decisional problems on rational relations
• Petri net languages and infinite subsets of \(\mathbb{N}^m\)
• From local to global temporal logics over Mazurkiewicz traces.
• The Shuffle Product: New Research Directions
• Adaptive Star Grammars
• Topology for Computations of Concurrent Automata
• A Kleene theorem for recognizable languages over concurrency monoids
• Asynchronous wreath product and cascade decompositions for concurrent behaviours
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Languages and logical definability in concurrency monoids
• Recognizable languages in concurrency monoids
• A note on the commutative closure of star-free languages
• Logical definability on infinite traces
• An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications
• Local testability from words to traces, a suitable definition
• On aperiodic and star-free formal power series in partially commuting variables

This page was built for publication: Star-free trace languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193878)