Revistes Publicacions URV: Triangle - llenguatge, literatura, computació> 2012

A Class of 2-Head Finite Automata for Linear Languages

  • Dades identificatives

    Identificador: RP:4410
    Handle: https://hdl.handle.net/20.500.11797/RP4410
    Autors:
    Nagy, Benedek
    Resum:
    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.

  • Altres:

    Autor segons l'article: Nagy, Benedek
    Paraules clau: language
    Resum: 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.
    Any de publicació de la revista: 2012
    Tipus de publicació: info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article