ON THE PROBLEM OF LOGIC-AUTOMATIC FORMULAS PERFORMABILITY
Background. In the theory of finite automata, there are a number of ways to define finite automata (finitely automatic functions). There are systems of canonical equations among them, Moore diagrams, information trees, schemes of automatic elements, and finite-automaton operations. Each of these...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penza State University Publishing House
2020-06-01
|
| Series: | Известия высших учебных заведений. Поволжский регион: Физико-математические науки |
| Subjects: |