scientific article; zbMATH DE number 512855

MaRDI QIDQ4281552zbMATH OpenFDO

Authors Leucio Guerra, Christian Choffrut

Publication date 10 March 1994

zbMATH Keywords

free monoidsrational trace languagessecond order logictrace monoids

Mathematics Subject Classification ID

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

Recommendations

• Logical definability of some rational trace languages
• A note on the logical definability of rational trace languages
• Trace languages definable with modular quantifiers
• On bounded rational trace languages
• scientific article; zbMATH DE number 176496
• Developments in Language Theory
• Logical definability on infinite traces
• Logical definability on infinite traces
• Rational and recognizable complex trace languages
• Characterizations of the decidability of some problems for regular trace languages

Cited in

(8)

• A note on the logical definability of rational trace languages
• A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
• scientific article; zbMATH DE number 4065312 (Why is no real title available?)
• Logical definability on infinite traces
• Logical definability of some rational trace languages
• Languages and logical definability in concurrency monoids
• Logical definability on infinite traces
• On bounded rational trace languages

This page was built for publication:

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