Old Web
English
Sign In
Acemap
>
Paper
>
The completeness criterion for systems which contain all one-place finite-automaton functions
The completeness criterion for systems which contain all one-place finite-automaton functions
2000
V A Buevich
Keywords:
Discrete mathematics
Mathematics
Combinatorics
Block cellular automaton
Probabilistic automaton
Deterministic finite automaton
Two-way deterministic finite automaton
Deterministic automaton
Nondeterministic finite automaton
Büchi automaton
Continuous automaton
Elementary cellular automaton
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
1
Citations
NaN
KQI
[]