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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Yaroslavl State University
2020-09-01
|
| Schriftenreihe: | Моделирование и анализ информационных систем |
| Schlagworte: | |
| Online-Zugang: | https://www.mais-journal.ru/jour/article/view/1349 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|