On the Descriptional Complexity of Deterministic Ordered Restarting Automata

被引：0
|
作者：
Otto, Friedrich [1 ]
机构：
[1] Univ Kassel, Fachbereich Elektrotech Informat, D-34109 Kassel, Germany
来源：
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014 | 2014年 / 8614卷
关键词：
restarting automaton; ordered rewriting; descriptional complexity; language operations;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that the deterministic ordered restarting automaton is polynomially related in size to the weight-reducing Hennie machine. Accordingly, it allows very compact representations of (some) regular languages. In addition, we investigate the descriptional complexity of the operations of reversal, complementation, intersection, and union for regular languages that are given through stateless deterministic ordered restarting automata.
引用
收藏
页码：318 / 329
页数：12
相关论文
共 50 条
  • [1] On the descriptional complexity of stateless deterministic ordered restarting automata
    Otto, Friedrich
    Kwee, Kent
    INFORMATION AND COMPUTATION, 2018, 259 : 277 - 302
  • [2] ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA
    Kutrib, Martin
    Otto, Friedrich
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (06) : 831 - 846
  • [3] Deterministic Ordered Restarting Automata that Compute Functions
    Otto, Friedrich
    Kwee, Kent
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 401 - 412
  • [4] Nondeterministic Ordered Restarting Automata
    Kwee, Kent
    Otto, Friedrich
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (04) : 663 - 685
  • [5] Reversible Ordered Restarting Automata
    Otto, Friedrich
    Wendlandt, Matthias
    Kwee, Kent
    REVERSIBLE COMPUTATION, RC 2015, 2015, 9138 : 60 - 75
  • [6] Descriptional complexity of limited automata
    Kutrib, Martin
    Pighizzini, Giovanni
    Wendlandt, Matthias
    INFORMATION AND COMPUTATION, 2018, 259 : 259 - 276
  • [7] A Pumping Lemma for Ordered Restarting Automata
    Kwee, Kent
    Otto, Friedrich
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017, 2017, 10316 : 226 - 237
  • [8] Ordered Restarting Automata for Picture Languages
    Mraz, Frantisek
    Otto, Friedrich
    SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 431 - 442
  • [9] On Deterministic Ordered Restart-Delete Automata
    Otto, Friedrich
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 529 - 540
  • [10] On deterministic ordered restart-delete automata
    Otto, Friedrich
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 257 - 274
12345