A Class of 2-Head Finite Automata for Linear Languages

• Autores: Benedek Nagy
• Localización: Triangle: Language, Literature, Computation = Lenguaje, Literatura, Computación = Llenguatge, Literatura, Computació, ISSN 2013-939X, Nº. 8, 2012 (Ejemplar dedicado a: Languages : Mathematical Approaches / María Dolores Jiménez-López (ed. lit.)), págs. 89-99
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Both deterministic and non-deterministic nite state machines (automata) recognize regular languages exactly. Now we extend these machines using two heads to characterize even-linear and linear languages. The heads move in opposite directions in these automata. For even-linear languages, deterministic automata have the same eciency as non-deterministic ones, but for the general case (linear languages) only the non-deterministic version is sucient. We compare our automata to other two-head automata as well.