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
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
-
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.