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 条
  • [41] Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata
    Holzer, Markus
    Kutrib, Martin
    REACHABILITY PROBLEMS, 2010, 6227 : 1 - 23
  • [42] Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata
    Martynova, Olga
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 249 - 260
  • [43] Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata
    Hundeshagen, Norbert
    Otto, Friedrich
    Vollweiler, Marcel
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 163 - 172
  • [44] From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity
    Gruber, Hermann
    Holzer, Markus
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (08) : 1009 - 1040
  • [45] Deterministic two-way restarting automata and Marcus contextual grammars
    Jurdzinski, T
    Otto, F
    Mráz, F
    Plátek, M
    FUNDAMENTA INFORMATICAE, 2005, 64 (1-4) : 217 - 228
  • [46] COMPLEXITY OF PROBABILISTIC VERSUS DETERMINISTIC AUTOMATA
    FREIVALDS, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 502 : 565 - 613
  • [47] On Deterministic Ordered Restart-Delete Automata
    Otto, Friedrich
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 529 - 540
  • [48] On deterministic ordered restart-delete automata
    Otto, Friedrich
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 257 - 274
  • [49] Extended Two-Way Ordered Restarting Automata for Picture Languages
    Otto, Friedrich
    Mraz, Frantisek
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 541 - 552
  • [50] From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity
    Gruber, Hermann
    Holzer, Markus
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 25 - 48
12345