Logical definability on infinite traces

DOI10.1007/3-540-56939-1_84zbMath1418.68116OpenAlexW4232688024MaRDI QIDQ4630272

Anca Muscholl, Werner Ebinger

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_84

zbMATH Keywords

monadic second-order logicdependence graphHasse diagramrecognizabilityfree variableinfinite tracereal trace language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)

Related Items (4)

EMSO-logic and automata related to homogeneous flow event structures ⋮ The monadic second-order logic of graphs. X: Linear orderings ⋮ An expressively complete linear time temporal logic for Mazurkiewicz traces ⋮ Representation of computations in concurrent automata by dependence orders

Cites Work

• A syntactic congruence for rational \(\omega\)-languages
• First-order logic and star-free sets
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
• Asynchronous cellular automata for infinite traces
• On finite monoids having only trivial subgroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logical definability on infinite traces