FINITE-STATE AUTOMATA IN INFORMATION TECHNOLOGIES

被引：1
|
作者：
Kryvyi, S. L. [1 ]
机构：
[1] Taras Shevchenko Natl Univ Kiev, Kiev, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2011年 / 47卷 / 05期
关键词：
finite-state automaton; Buchi automaton; Muller automaton; verification;
D O I：
10.1007/s10559-011-9347-x
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A short review of applications of finite-state automata in some modern areas of computer science and technologies is presented. In particular, fields of application of finite-state automata in computer algebra, Petri nets, biology, and verification are considered.
引用
收藏
页码：669 / 683
页数：15
相关论文
共 50 条
  • [31] Methods of constructing universal tests for finite-state automata
    V. A. Tverdokhlebov
    Automation and Remote Control, 2005, 66 (1) : 139 - 147
  • [32] Shorter regular expressions from finite-state automata
    Han, YS
    Wood, D
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 141 - 152
  • [33] Compression of finite-state automata through failure transitions
    Bjorklund, Henrik
    Bjorklund, Johanna
    Zechner, Niklas
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 87 - 100
  • [34] Methods of constructing universal tests for finite-state automata
    Tverdokhlebov, VA
    AUTOMATION AND REMOTE CONTROL, 2005, 66 (01) : 139 - 147
  • [35] Incremental construction of minimal acyclic finite-state automata
    Daciuk, J
    Mihov, S
    Watson, BW
    Watson, RE
    COMPUTATIONAL LINGUISTICS, 2000, 26 (01) : 3 - 16
  • [36] Finite-state registered automata and their uses in natural languages
    Cohen-Sygal, Yael
    Wintner, Shuly
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 43 - +
  • [37] ON INFORMATION RATES FOR FINITE-STATE CHANNELS
    BIRCH, JJ
    INFORMATION AND CONTROL, 1963, 6 (04): : 372 - &
  • [38] Initial-and-Final-State Detectability of Nondeterministic Finite-State Automata
    Shen, Liren
    Miao, Shaowen
    Lai, Aiwen
    Jan Komenda
    Lahaye, Sebastien
    2024 14TH ASIAN CONTROL CONFERENCE, ASCC 2024, 2024, : 509 - 514
  • [39] FINITE-STATE AUTOMATA FROM REGULAR EXPRESSION-TREES
    GOLDBERG, RR
    COMPUTER JOURNAL, 1993, 36 (07): : 623 - 630
  • [40] Obtaining shorter regular expressions from finite-state automata
    Han, Yo-Sub
    Wood, Derick
    THEORETICAL COMPUTER SCIENCE, 2007, 370 (1-3) : 110 - 120
12345