• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

Полиномиальный алгоритм проверки эквивалентности детерминированных двухленточных автоматов

С. 128-130.
Захаров В. А.

It is shown how the verification of the equivalence of two-tape deterministic automata can be reduced to the problem of checking the equivalence of weakly nondeterministic finite automata-transformers working on the semigroup of prefix regular languages ​​with the concatenation operation.