Algorithmic unsolvability of the problem of recognition of recursive event representability by finite automata (Q2625102)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic unsolvability of the problem of recognition of recursive event representability by finite automata |
scientific article |
Statements
Algorithmic unsolvability of the problem of recognition of recursive event representability by finite automata (English)
0 references
1961
0 references
Two theorems on the capability of finite automata are proved. They are known to everyone acquainted with the rudiments of regular events and algorithms.
0 references
