Proves Myhill-Nerode theorem for HDAs: language regular iff finite prefix quotient; shows deterministic HDAs are strictly weaker than nondeterministic ones.
Operational Semantics, Interval Orders and Sequences of Antichains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.