Comparison of digital search algorithms and finite-state automata of regular expressions

被引：0

作者：

机构：

[1] Maryanov, P.A.

[2] Kuzmin, A.L.

来源：

Maryanov, P.A. (wrpg@mail.ru) | 1600年 / Begell House Inc.卷 / 72期

关键词：

D O I：

10.1615/TelecomRadEng.v72.i3.60

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Shorter regular expressions from finite-state automata
Han, YS
Wood, D
IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 141 - 152
[2] Obtaining shorter regular expressions from finite-state automata
Han, Yo-Sub
Wood, Derick
THEORETICAL COMPUTER SCIENCE, 2007, 370 (1-3) : 110 - 120
[3] STATE CHARACTERISTIC EQUATIONS OF FINITE AUTOMATA AND THEIR REGULAR EXPRESSIONS
UDAGAWA, K
INAGAKI, Y
TANGE, H
ELECTRONICS & COMMUNICATIONS IN JAPAN, 1965, 48 (09): : 25 - &
[4] FINITE-STATE AUTOMATA FROM REGULAR EXPRESSION-TREES
GOLDBERG, RR
COMPUTER JOURNAL, 1993, 36 (07): : 623 - 630
[5] Compiling regular formalisms with rule features into finite-state automata
Kiraz, GA
35TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 8TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, 1997, : 329 - 336
[6] REGULAR EXPRESSIONS INTO FINITE AUTOMATA
BRUGGEMANNKLEIN, A
THEORETICAL COMPUTER SCIENCE, 1993, 120 (02) : 197 - 213
[7] Regular Expressions and Predicate Logic in Finite-State Language Processing
Hulden, Mans
FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2009, 191 : 82 - 97
[8] REGULAR EXPRESSIONS INTO FINITE AUTOMATA
BRUGGEMANNKLEIN, A
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 583 : 87 - 98
[9] Smaller representations for finite-state transducers and finite-state automata
Roche, E
COMBINATORIAL PATTERN MATCHING, 1995, 937 : 352 - 365
[10] Rough finite-state automata
Basu, S
CYBERNETICS AND SYSTEMS, 2005, 36 (02) : 107 - 124

← 1 2 3 4 5 →