Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
Complexity of input-driven pushd own 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
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.
citing papers explorer
-
Visibly Recursive Automata
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
-
Descriptional Complexity of Finite Automata -- Selected Highlights
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.