Logical definability of some rational trace languages

DOI10.1007/BF01185864zbMath0833.68099MaRDI QIDQ4850330

Leucio Guerra, Christian Choffrut

Publication date: 11 March 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

trace monoids

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Generalized rational relations and their logical definability ⋮ From local to global temporal logics over Mazurkiewicz traces.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logical approach of Petri net languages
• First-order logic and star-free sets
• On regular trace languages
• Theory of traces
• Classifying regular events in symbolic logic
• Semigroups, Presburger formulas, and languages
• Equidivisible semigroups
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Characterizations of the decidability of some problems for regular trace languages

This page was built for publication: Logical definability of some rational trace languages