On the Average Size of Glushkov's Automata

被引：26
|
作者：
Nicaud, Cyril [1 ]
机构：
[1] Univ Paris Est, CNRS, UMR 8049, LIGM, F-77454 Marne La Vallee, France
来源：
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS | 2009年 / 5457卷
关键词：
REGULAR EXPRESSIONS;
D O I：
10.1007/978-3-642-00982-2_53
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Glushkov's algorithm builds an epsilon-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of transitions is quadratic in the size of the expression. We show in this paper that in average, the number of transitions is linear.
引用
收藏
页码：626 / 637
页数：12
相关论文
共 50 条
  • [1] ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
    Broda, Sabine
    Machiavelo, Antonio
    Moreira, Nelma
    Reis, Rogerio
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (05) : 969 - 984
  • [2] Average Analysis of Glushkov Automata under a BST-Like Model
    Nicaud, Cyril
    Pivoteau, Carine
    Razet, Benoit
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 388 - 399
  • [3] Characterization of Glushkov automata
    Caron, P
    Ziadi, D
    THEORETICAL COMPUTER SCIENCE, 2000, 233 (1-2) : 75 - 90
  • [4] Space-Efficient Representations for Glushkov Automata
    Zhang, Meng
    Zhang, Yi
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (07) : 1089 - 1105
  • [5] A unified construction of the Glushkov, follow, and Antimirov automata
    Allauzen, Cyril
    Mohri, Mehryar
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 110 - 121
  • [6] Multi-tilde Operators and Their Glushkov Automata
    Caron, Pascal
    Champarnaud, Jean-Marc
    Mignot, Ludovic
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 290 - 301
  • [7] AVERAGE SIZE OF AUTOMATA CONSTRUCTIONS FROM REGULAR EXPRESSIONS
    Pighizzini, Giovanni
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2015, European Association for Theoretical Computer Science (116): : 167 - 191
  • [8] GLUSHKOV'S EVIDENCE ALGORITHM
    Letichevsky, A. A.
    Lyaletski, A. V.
    Morokhovets, M. K.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2013, 49 (04) : 489 - 500
  • [9] Artin's Conjecture and size of finite probabilistic automata
    Freivalds, Rusins
    PILLARS OF COMPUTER SCIENCE, 2008, 4800 : 280 - 291
  • [10] Minimization of Limit-Average Automata
    Michaliszyn, Jakub
    Otop, Jan
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 2819 - 2825
12345