Computing ϵ-Free NFA from Regular Expressions in O(n log2(n)) Time
RAIRO-Theor. Inf. Appl., 34 4 (2000) 257-277
Published online: 2002-04-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
15981 267 (2026)
https://doi.org/10.1007/978-3-032-02602-6_19
Passive testing with asynchronous communications and timestamps
Mercedes G. Merayo, Robert M. Hierons and M. NúñezDistributed Computing 31 (5) 327 (2018)
https://doi.org/10.1007/s00446-017-0308-0
Scalable Analysis for Multi-Scale Dataflow Models
Hadi Alizadeh Ara, Amir Behrouzian, Martijn Hendriks, et al.ACM Transactions on Embedded Computing Systems 17 (4) 1 (2018)
https://doi.org/10.1145/3233183
Efficient testing and matching of deterministic regular expressions
B. Groz and S. ManethJournal of Computer and System Sciences 89 372 (2017)
https://doi.org/10.1016/j.jcss.2017.05.013
VISUAL: Simulation of Visual Subgraph Query Formulation to Enable Automated Performance Benchmarking
Sourav S. Bhowmick, Huey Eng Chua, Byron Choi and Curtis DyresonIEEE Transactions on Knowledge and Data Engineering 29 (8) 1765 (2017)
https://doi.org/10.1109/TKDE.2017.2690392
Postfix automata
Maohua Jing, Yixian Yang, Ning Lu, Wenbo Shi and Changyong YuTheoretical Computer Science 562 590 (2015)
https://doi.org/10.1016/j.tcs.2014.10.050
Language and Automata Theory and Applications
Antoine Ndione, Aurélien Lemay and Joachim NiehrenLecture Notes in Computer Science, Language and Automata Theory and Applications 8977 739 (2015)
https://doi.org/10.1007/978-3-319-15579-1_58
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity
Hermann Gruber and Markus HolzerElectronic Proceedings in Theoretical Computer Science 151 25 (2014)
https://doi.org/10.4204/EPTCS.151.2
Formal Techniques for Distributed Systems
Robert M. Hierons, Mercedes G. Merayo and Manuel NúñezLecture Notes in Computer Science, Formal Techniques for Distributed Systems 7892 99 (2013)
https://doi.org/10.1007/978-3-642-38592-6_8
THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
MARKUS HOLZER and MARTIN KUTRIBInternational Journal of Foundations of Computer Science 22 (07) 1533 (2011)
https://doi.org/10.1142/S0129054111008866
Developments in Language Theory
Markus Holzer and Martin KutribLecture Notes in Computer Science, Developments in Language Theory 6224 16 (2010)
https://doi.org/10.1007/978-3-642-14455-4_3
NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
MARKUS HOLZER and MARTIN KUTRIBInternational Journal of Foundations of Computer Science 20 (04) 563 (2009)
https://doi.org/10.1142/S0129054109006747
Deciding determinism of caterpillar expressions
Kai Salomaa, Sheng Yu and Jinfeng ZanTheoretical Computer Science 410 (37) 3438 (2009)
https://doi.org/10.1016/j.tcs.2009.03.010
Lower bounds for the transition complexity of NFAs
Michael Domaratzki and Kai SalomaaJournal of Computer and System Sciences 74 (7) 1116 (2008)
https://doi.org/10.1016/j.jcss.2008.02.007
Efficient weighted expressions conversion
Faissal Ouardi and Djelloul ZiadiRAIRO - Theoretical Informatics and Applications 42 (2) 285 (2008)
https://doi.org/10.1051/ita:2007035
Implementation and Applications of Automata
Markus Holzer and Martin KutribLecture Notes in Computer Science, Implementation and Applications of Automata 5148 1 (2008)
https://doi.org/10.1007/978-3-540-70844-5_1
Implementation and Application of Automata
Kai Salomaa, Sheng Yu and Jinfeng ZanLecture Notes in Computer Science, Implementation and Application of Automata 4783 97 (2007)
https://doi.org/10.1007/978-3-540-76336-9_11
Implementation and Application of Automata
Jacques SakarovitchLecture Notes in Computer Science, Implementation and Application of Automata 3845 15 (2006)
https://doi.org/10.1007/11605157_2
STACS 2006
Georg SchnitgerLecture Notes in Computer Science, STACS 2006 3884 432 (2006)
https://doi.org/10.1007/11672142_35
Combinatorial Pattern Matching
Lucian Ilie, Roberto Solis-Oba and Sheng YuLecture Notes in Computer Science, Combinatorial Pattern Matching 3537 310 (2005)
https://doi.org/10.1007/11496656_27
Implementation and Application of Automata
Jean-Marc Champarnaud, Florent Nicart and Djelloul ZiadiLecture Notes in Computer Science, Implementation and Application of Automata 3317 90 (2005)
https://doi.org/10.1007/978-3-540-30500-2_9
1385 (2005)
https://doi.org/10.1145/1066677.1066992
Theory Is Forever
Lucian Ilie, Gonzalo Navarro and Sheng YuLecture Notes in Computer Science, Theory Is Forever 3113 112 (2004)
https://doi.org/10.1007/978-3-540-27812-2_11
Reducing NFAs by invariant equivalences
Lucian Ilie and Sheng YuTheoretical Computer Science 306 (1-3) 373 (2003)
https://doi.org/10.1016/S0304-3975(03)00311-6
Developments in Language Theory
Sebastian SeibertLecture Notes in Computer Science, Developments in Language Theory 2450 28 (2003)
https://doi.org/10.1007/3-540-45005-X_3
A lower bound on the size of ε-free NFA corresponding to a regular expression
Yuri LifshitsInformation Processing Letters 85 (6) 293 (2003)
https://doi.org/10.1016/S0020-0190(02)00436-2
Follow automata
Lucian Ilie and Sheng YuInformation and Computation 186 (1) 140 (2003)
https://doi.org/10.1016/S0890-5401(03)00090-7
On Shuffle Ideals
Pierre-Cyrille HéamRAIRO - Theoretical Informatics and Applications 36 (4) 359 (2002)
https://doi.org/10.1051/ita:2003002
Mathematical Foundations of Computer Science 2002
Lucian Iliea and Sheng YuLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2002 2420 328 (2002)
https://doi.org/10.1007/3-540-45687-2_27
Combinatorial Pattern Matching
Lucian Ilie and Sheng YuLecture Notes in Computer Science, Combinatorial Pattern Matching 2373 279 (2002)
https://doi.org/10.1007/3-540-45452-7_23
Combinatorial Pattern Matching
Jean-Marc Champarnaud and Djelloul ZiadiLecture Notes in Computer Science, Combinatorial Pattern Matching 2089 157 (2001)
https://doi.org/10.1007/3-540-48194-X_15