Proves Myhill-Nerode theorem for HDAs: language regular iff finite prefix quotient; shows deterministic HDAs are strictly weaker than nondeterministic ones.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative 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.