A Myhill-Nerode theorem for higher-dimensional automata

DOI10.1007/978-3-031-33620-1_9MaRDI QIDQ6535191zbMATH OpenFDO

Authors Uli Fahrenberg, Krzysztof Ziemiański

Publication date 16 November 2023

zbMATH Keywords

determinismhigher-dimensional automataconcurrency theoryMyhill-Nerode theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A Kleene theorem for higher-dimensional automata
• Languages of higher-dimensional automata
• Algebraic Myhill-Nerode theorems
• Myhill-Nerode type theory for fuzzy languages and automata

Cites work

• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 1927576 (Why is no real title available?)
• Active automata learning as black-box search and lazy partition refinement
• Coalgebra learning via duality
• Concurrent Machines
• Configuration structures, event structures and Petri nets
• Erratum to ``On the expressiveness of higher dimensional automata
• Languages of higher-dimensional automata
• Learning pomset automata
• Learning regular sets from queries and counterexamples
• Modular construction and partial order semantics of Petri nets
• On the expressiveness of higher dimensional automata
• Operational semantics, interval orders and sequences of antichains
• Partial higher-dimensional automata
• Petri nets, event structures and domains. I
• Pomset Languages of Finite Step Transition Systems
• Posets with interfaces as a model for concurrency
• Refinement of actions and equivalence notions for concurrent systems
• Relating word and tree automata
• ST-structures
• Solving Games Without Determinization
• Structure of concurrency
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Transition and cancellation in concurrency and branching time
• Trees in partial higher dimensional automata

Cited in

(6)

• Myhill-Nerode theorem for higher-dimensional automata
• Closure and decision properties for higher-dimensional automata
• Higher dimensional automata revisited
• A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
• Implementation and Application of Automata
• A Kleene theorem for higher-dimensional automata

This page was built for publication: A Myhill-Nerode theorem for higher-dimensional automata

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