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.
Yamakami (2019): State complexity characterizations of parameterized degree-bounded graph connectiv- ity, sub-linear space computation, and the linear space hypothesis
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
-
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.