Introduces 2-HRFA and B2-HRFA for picture languages, proves incomparability with CFMG, proper subset relations with RPDA and RFA, and examines closure properties.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
2-Head 2D Returning Finite Automata
Introduces 2-HRFA and B2-HRFA for picture languages, proves incomparability with CFMG, proper subset relations with RPDA and RFA, and examines closure properties.
-
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.