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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Penza State University Publishing House
2020-06-01
|
| coleção: | Известия высших учебных заведений. Поволжский регион: Физико-математические науки |
| Assuntos: | |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|