Rectangles and squares recognized by two-dimensional automata

被引:0
|
作者
Kari, J [1 ]
Moore, C
机构
[1] Univ Turku, Dept Math, FIN-20014 Turku, Finland
[2] Univ Iowa, Dept Comp Sci, Iowa City, IA 52242 USA
[3] Univ New Mexico, Dept Comp Sci, Albuquerque, NM 87131 USA
[4] Univ New Mexico, Dept Phys & Astron, Albuquerque, NM 87131 USA
[5] Santa Fe Inst, Santa Fe, NM 87501 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider sets of rectangles and squares recognized by deterministic and non-deterministic two-dimensional finite-state automata. We show that sets of squares recognized by DFAs from the inside can be as sparse as any recursively enumerable set. We also show that NFAs can only recognize sets of rectangles from the outside that correspond to simple regular languages.
引用
收藏
页码:134 / 144
页数:11
相关论文
共 50 条