On the class of games of finite automata

被引：0
|
作者：
Izmajlov, R.N. [1 ]
Pokrovskij, A.V. [1 ]
Chernorutskij, V.V. [1 ]
机构：
[1] Inst Problem Peredachi Informatsii, RAN, Moscow, Russia
来源：
Avtomatika i Telemekhanika | 1993年 / 08期
关键词：
Algorithms - Automata theory - Automation - Computers - Finite automata - Logic programming - Models;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Special games class of two finite automata with zero sum is discussed. Informal game description is: first player gives one from two numbers: zero or unit, second player (it is a computer) divines the given number by means of information processing on the previous moves. The problem is: can be used the advantage in information without the one in intellect.
引用
收藏
页码：142 / 148
相关论文
共 50 条
12345