Representations of regular ideals in finite automata

被引：1
作者：
Rystsov, I.K. [1 ]
机构：
[1] Interregional Academy of Personnel Management, Kiev
来源：
Cybernetics and Systems Analysis | 2003年 / 39卷 / 05期
关键词：
Cerny problem; Finite automata; Linear automata; Representation of events;
D O I：
10.1023/B:CASA.0000012087.71746.0e
中图分类号：
学科分类号：
摘要：
Regular ideals of a free monoid are shown to be characterized by weak (noninitial) representations in finite automata. The class of kernel ideals is also shown to be invariant under the action of several automata functors and to be equal to the class of zero ideals. © Plenum Publishing Corporation 2003.
引用
收藏
页码：668 / 675
页数：7
相关论文
共 50 条
  • [1] From regular expressions to finite automata
    Champarnaud, JM
    Ponty, JL
    Ziadi, D
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 72 (04) : 415 - 431
  • [2] Embedding finite automata within regular expressions
    Ben-David, Shoham
    Fisman, Dana
    Ruah, Sitvanit
    THEORETICAL COMPUTER SCIENCE, 2008, 404 (03) : 202 - 218
  • [3] SCANNING REGULAR LANGUAGES BY DUAL FINITE AUTOMATA
    WU, PC
    WANG, FJ
    YOUNG, KR
    SIGPLAN NOTICES, 1992, 27 (04): : 12 - 16
  • [4] Exploring Different Automata Representations for Efficient Regular Expression Matching on GPUs
    Yu, Xiaodong
    Becchi, Michela
    ACM SIGPLAN NOTICES, 2013, 48 (08) : 287 - 288
  • [5] Translating regular expressions into small ε-free nondeterministic finite automata
    Hromkovic, J
    Seibert, S
    Wilke, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (04) : 565 - 588
  • [6] 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
  • [7] Efficient implementation of regular languages using reversed alternating finite automata
    Salomaa, K
    Wu, X
    Yu, S
    THEORETICAL COMPUTER SCIENCE, 2000, 231 (01) : 103 - 111
  • [8] Syntactic Complexity of Regular Ideals
    Brzozowski, Janusz A.
    Szykula, Marek
    Ye, Yuli
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (05) : 1175 - 1202
  • [9] Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
    Ouardi, Faissal
    Champarnaud, Jean-Marc
    Ziadi, Djelloul
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 33 : 58 - 70
  • [10] An Infinite Proper Subset of Regular Languages as a State Change Based Coupling of Finite Automata
    Cevik, Ahmet
    Kilic, Hurevren
    WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2015, VOL I, 2015, : 55 - 58
12345