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 条
  • [21] Behaviours of Unary Quantum Automata
    Bianchi, Maria Paola
    Palano, Beatrice
    [J]. FUNDAMENTA INFORMATICAE, 2010, 104 (1-2) : 1 - 15
  • [22] Probabilistic and nondeterministic unary automata
    Gramlich, G
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 460 - 469
  • [23] Regularity of Unary Probabilistic Automata
    Akshay, S.
    Genest, Blaise
    Karelovic, Bruno
    Vyas, Nikhil
    [J]. 33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [24] COMPLEMENTS OF UNARY L LANGUAGES
    KLOVE, T
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (01) : 56 - 66
  • [25] Deciding determinism of unary languages
    Lu, Ping
    Peng, Feifei
    Chen, Haiming
    Zheng, Lixiao
    [J]. INFORMATION AND COMPUTATION, 2015, 245 : 181 - 196
  • [26] Cellular devices and unary languages
    Klein, Andreas
    Kutrib, Martin
    [J]. FUNDAMENTA INFORMATICAE, 2007, 78 (03) : 343 - 368
  • [27] TOL LANGUAGES - UNARY SYSTEMS
    LATTEUX, M
    [J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, 9 (NR3): : 51 - 62
  • [28] Erratum: Finite automata and unary languages (Theoretical Computer Science (1986) 47 (149-158))
    Chrobak, Marek
    [J]. Theoretical Computer Science, 2003, 302 (1-3) : 497 - 498
  • [29] NORMAL FORMS FOR UNARY PROBABILISTIC AUTOMATA
    Bianchi, Maria Paola
    Pighizzini, Giovanni
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2012, 46 (04): : 495 - 510
  • [30] On the Size of Unary Probabilistic and Nondeterministic Automata
    Bianchi, Maria Paola
    Mereghetti, Carlo
    Palano, Beatrice
    Pighizzini, Giovanni
    [J]. FUNDAMENTA INFORMATICAE, 2011, 112 (2-3) : 119 - 135
12345