Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
Pearson international edition, Addison- Wesley (2007)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Visibly Recursive Automata
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.