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 条
  • [21] On the Descriptional Complexity of the Direct Product of Finite Automata
    Holzer, Markus
    Rauch, Christian
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2022, 2022, 13439 : 100 - 111
  • [22] More on the Descriptional Complexity of Products of Finite Automata
    Holzer, Markus
    Rauch, Christian
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021, 2021, 13037 : 76 - 87
  • [23] Descriptional Complexity of Finite Automata - Selected Highlights
    Salomaa, Arto
    Salomaa, Kai
    Smith, Taylor J.
    FUNDAMENTA INFORMATICAE, 2024, 191 (3-4) : 231 - 268
  • [24] More on the Descriptional Complexity of Products of Finite Automata
    Holzer, Markus
    Rauch, Christian
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [25] Deleting Deterministic Restarting Automata with Two Windows
    Mraz, Frantisek
    Otto, Friedrich
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 272 - 283
  • [26] ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
    Messerschmidt, Hartmut
    Otto, Friedrich
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (01) : 185 - 209
  • [27] Descriptional and computational complexity of finite automata-A survey
    Holzer, Markus
    Kutrib, Martin
    INFORMATION AND COMPUTATION, 2011, 209 (03) : 456 - 470
  • [28] On the descriptional complexity of finite automata with modified acceptance conditions
    Holzer, M
    Kutrib, M
    THEORETICAL COMPUTER SCIENCE, 2005, 330 (02) : 267 - 285
  • [29] Closure properties and descriptional complexity of deterministic regular expressions
    Losemann, Katja
    Martens, Wim
    Niewerth, Matthias
    THEORETICAL COMPUTER SCIENCE, 2016, 627 : 54 - 70
  • [30] Strictly deterministic CD-systems of restarting automata
    Messerschmidt, H.
    Otto, F.
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2007, 4639 : 424 - +
12345