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...
Main Author: | Vladimir A. Zakharov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2020-09-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/1349 |
Similar Items
-
On the Minimization of Finite State Trans- ducers over Semigroups
by: V. A. Zakharov, et al.
Published: (2016-12-01) -
On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic
by: Anton Romanovich Gnatenko, et al.
Published: (2021-12-01) -
On the Model Checking Problem for Some Extension of CTL*
by: Anton Romanovich Gnatenko, et al.
Published: (2020-12-01) -
EXPRESSION OF THE MEANING OF ACTION TEMPORAL LOCALISATION/NON-LOCALIZATION IN THE UTTERANCE WITH SUBORDINATE CLAUSE OF TIME
by: Аlexandra А. Agapitova
Published: (2010-09-01) -
POETIC LICENCES IN METATEXTS OF THE 17TH TO EARLY 18TH CENTURIES
by: A Yu Mikhaylenko
Published: (2017-12-01)