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 条
  • [31] Optimal simulations between unary automata
    Mereghetti, C
    Pighizzini, G
    [J]. SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1976 - 1992
  • [32] Unary Watson-Crick automata
    Chatterjee, Kingshuk
    Ray, Kumar Sankar
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 782 : 107 - 112
  • [33] Optimal simulations between unary automata
    Mereghetti, C
    Pighizzini, G
    [J]. STACS 98 - 15TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1998, 1373 : 139 - 149
  • [34] FORGETTING LANGUAGES AND MATHEMATICS
    LOMBARD, P
    [J]. REVUE FRANCAISE DE PSYCHANALYSE, 1985, 49 (03): : 889 - 895
  • [35] Converting two-way nondeterministic unary automata into simpler automata
    Geffert, V
    Mereghetti, C
    Pighizzini, G
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 189 - 203
  • [36] Converting two-way nondeterministic unary automata into simpler automata
    Geffert, V
    Mereghetti, C
    Pighizzini, G
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 398 - 407
  • [37] Unambiguous finite automata over a unary alphabet
    Okhotin, Alexander
    [J]. INFORMATION AND COMPUTATION, 2012, 212 : 15 - 36
  • [38] Complexity of Unary Exclusive Nondeterministic Finite Automata
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (407):
  • [39] Unary Probabilistic and Quantum Automata on Promise Problems
    Gainutdinova, Aida
    Yakaryilmaz, Abuzer
    [J]. DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 252 - 263
  • [40] Decision Problems on Unary Probabilistic and Quantum Automata
    Hirvensalo, Mika
    Yakaryilmaz, Abuzer
    [J]. BALTIC JOURNAL OF MODERN COMPUTING, 2016, 4 (04): : 965 - 976
12345