Higher-dimensional automata receive order-free semantics via interval ipomsets, with proofs that ST traces match these structures, presentations are isomorphic, and bisimulations are characterized by ipomset isomorphism.
Languages of Higher-Dimensional Automata
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2verdicts
UNVERDICTED 2representative citing papers
Proves Myhill-Nerode theorem for HDAs: language regular iff finite prefix quotient; shows deterministic HDAs are strictly weaker than nondeterministic ones.
citing papers explorer
-
Forgetting Event Order in Higher-Dimensional Automata
Higher-dimensional automata receive order-free semantics via interval ipomsets, with proofs that ST traces match these structures, presentations are isomorphic, and bisimulations are characterized by ipomset isomorphism.
-
Myhill-Nerode Theorem for Higher-Dimensional Automata
Proves Myhill-Nerode theorem for HDAs: language regular iff finite prefix quotient; shows deterministic HDAs are strictly weaker than nondeterministic ones.