Explores effects of state-complexity size and input-length ceiling bounds on nonuniform two-way finite and pushdown automata families and their relation to advised space classes.
Title resolution pending
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
-
How Can Size and Ceiling Bounds Affect the Complexity of Nonuniform Automata Families?
Explores effects of state-complexity size and input-length ceiling bounds on nonuniform two-way finite and pushdown automata families and their relation to advised space classes.
-
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.