Forgetting automata and unary languages

被引：3
|
作者：
Gloeckler, Jens [1 ]
机构：
[1] Univ Giessen, Inst Informat, D-35392 Giessen, Germany
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2007年 / 18卷 / 04期
关键词：
forgetting automata; erasing automata; list automata;
D O I：
10.1142/S0129054107004991
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider forgetting automata, i.e., linear bounded automata which can only use the operations "move", "erase" (rewrite with a blank symbol) and "delete" (remove completely). A classification of the families of languages corresponding to the possible combinations of operations has been given in [1], here we address some of the problems left open. Furthermore the unary case is being investigated.
引用
收藏
页码：813 / 827
页数：15
相关论文
共 50 条
12345