Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines

Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite-State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode. The computations of these three types of automata...

Descrición completa

Detalles Bibliográficos

Autor Principal:	Vladimir A. Zakharov
Formato:	Artigo
Idioma:	Inglês
Publicado:	Yaroslavl State University 2020-09-01
Series:	Моделирование и анализ информационных систем
Assuntos:	transducer two-tape automaton biatomaton simple grammar equivalence checking prefix-free language language equation decision procedure
Acceso en liña:	https://www.mais-journal.ru/jour/article/view/1349
Tags:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!