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
verdicts
UNVERDICTED 2representative citing papers
Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.
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.
-
Mirroring Call-by-Need, or Values Acting Silly
Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.