STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES

DOI10.1142/S0218196791000092zbMath0734.68055OpenAlexW2033507669MaRDI QIDQ3361892

Jean-Camille Birget

Publication date: 1991

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196791000092

zbMATH Keywords

picture languagedeterministic two-way finite automatonlocally testable language

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items

State-complexity of finite-state devices, state compressibility and incompressibility ⋮ Leftmove-bounded picture languages