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 条
  • [31] Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
    Valdats, Maris
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 105 - 117
  • [32] Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
    Klima, Ondrej
    Polak, Libor
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 130 - 138
  • [33] On the complexity of 2-monotone restarting automata
    Jurdzinski, T
    Otto, F
    Mráz, F
    Plátek, M
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 237 - 248
  • [34] On the complexity of 2-monotone restarting automata
    Jurdzinski, Tomasz
    Otto, Friedrich
    Mraz, Frantiek
    Platek, Martin
    THEORY OF COMPUTING SYSTEMS, 2008, 42 (04) : 488 - 518
  • [35] On the Complexity of 2-Monotone Restarting Automata
    Tomasz Jurdziński
    Friedrich Otto
    František Mráz
    Martin Plátek
    Theory of Computing Systems, 2008, 42 : 488 - 518
  • [36] Nondeterministic finite automata - Recent results on the descriptional and computational complexity
    Holzer, Markus
    Kutrib, Martin
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 1 - +
  • [37] NONDETERMINISTIC FINITE AUTOMATA - RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
    Holzer, Markus
    Kutrib, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (04) : 563 - 580
  • [38] Descriptional complexity of unambiguous input-driven pushdown automata
    Okhotin, Alexander
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2015, 566 : 1 - 11
  • [39] A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
    Hartmut Messerschmidt
    Friedrich Otto
    Theory of Computing Systems, 2011, 48 : 343 - 373
  • [40] A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
    Messerschmidt, Hartmut
    Otto, Friedrich
    THEORY OF COMPUTING SYSTEMS, 2011, 48 (02) : 343 - 373
12345