Fast and compact regular expression matchingBILLE, Philip; FARACH-COLTON, Martin.Theoretical computer science. 2008, Vol 409, Num 3, pp 486-496, issn 0304-3975, 11 p.Article

Regular expressions with nested levels of back referencing form a hierarchyLARSEN, K. S.Information processing letters. 1998, Vol 65, Num 4, pp 169-172, issn 0020-0190Article

Greedy regular expression matchingFRISCH, Alain; CARDELLI, Luca.Lecture notes in computer science. 2004, pp 618-629, issn 0302-9743, isbn 3-540-22849-7, 12 p.Conference Paper

Regular relations and bicartesian squaresBANACH, R.Theoretical computer science. 1994, Vol 129, Num 1, pp 187-192, issn 0304-3975Article

A characterization of regular expressions under bisimulationBAETEN, J. C. M; CORRADINI, F; GRABMAYER, C. A et al.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 2, pp 1-28, issn 0004-5411, 28 p.Article

Unicode Canonical Decomposition for Hangeul Syllables in Regular ExpressionHEE YUAN TAN; LIM, Hyotaek.IEICE transactions on information and systems. 2011, Vol 94, Num 1, pp 146-154, issn 0916-8532, 9 p.Article

Shuffle grammarsARAKI, T; TOKURA, N; KOSAI, S et al.Systems, computers, controls. 1983, Vol 14, Num 4, pp 37-45, issn 0096-8765Article

On complete sets of samples for generalized regular expressionsKINBER, E. B.Theoretical computer science. 1991, Vol 91, Num 1, pp 101-117, issn 0304-3975Article

On the urgency expressivenessADELAÏDE, Michaël; PAGETTI, Claire.Lecture notes in computer science. 2004, pp 71-83, issn 0302-9743, isbn 3-540-24058-6, 13 p.Conference Paper

SEQ.OPEN: A tool for efficient trace-based verificationGARAVEL, Hubert; MATEESCU, Radu.Lecture notes in computer science. 2004, pp 151-157, issn 0302-9743, isbn 3-540-21314-7, 7 p.Conference Paper

Directly constructing minimal DFAs: Combining two algorithms by BrzozowskiWATSON, Bruce W.Lecture notes in computer science. 2001, pp 311-317, issn 0302-9743, isbn 3-540-42491-1Conference Paper

A note on pure codesHUANG, C. C.Acta informatica. 2010, Vol 47, Num 5-6, pp 347-357, issn 0001-5903, 11 p.Article

An efficient algorithm for mining frequent sequences by a new strategy without support countingCHIU, Ding-Ying; WU, Yi-Hung; CHEN, Arbee L. P et al.International Conference on data engineering. 2004, pp 375-386, isbn 0-7695-2065-0, 1Vol, 12 p.Conference Paper

Thompson digraphs: A characterizationGIAMMARRESI, Dora; PONTY, Jean-Luc; WOOD, Derick et al.Lecture notes in computer science. 2001, pp 91-100, issn 0302-9743, isbn 3-540-42812-7Conference Paper

Eyes on the thrones : Imperial ophthalmologic nicknamesLASCARATOS, J.Survey of ophthalmology. 1999, Vol 44, Num 1, pp 73-78, issn 0039-6257Article

More concise representation of regular languages by automata and regular expressionsGEFFERT, Viliam; MEREGHETTI, Carlo; PALANO, Beatrice et al.Information and computation (Print). 2010, Vol 208, Num 4, pp 385-394, issn 0890-5401, 10 p.Article

Classifying regular languages by a split gameQIQI YAN.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 181-190, issn 0304-3975, 10 p.Article

New operations and regular expressions for two-dimensional languages over one-letter alphabetANSELMO, Marcella; GIAMMARRESI, Dora; MADONIA, Maria et al.Theoretical computer science. 2005, Vol 340, Num 2, pp 408-431, issn 0304-3975, 24 p.Article

From regular expressions to smaller NFAsGARCIA, Pedro; LOPEZ, Damián; RUIZ, José et al.Theoretical computer science. 2011, Vol 412, Num 41, pp 5802-5807, issn 0304-3975, 6 p.Article

Prefix-free regular languages and pattern matchingHAN, Yo-Sub; YAJUN WANG; WOOD, Derick et al.Theoretical computer science. 2007, Vol 389, Num 1-2, pp 307-317, issn 0304-3975, 11 p.Article

Towards Fast Regular Expression Matching in PracticeKAI WANG; JUN LI.Computer communication review. 2013, Vol 43, Num 4, pp 531-532, issn 0146-4833, 2 p.Conference Paper

REMARK ON THE STAR-HEIGHT-PROBLEMTHOMAS W.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 13; NO 2; PP. 231-237; BIBL. 4 REF.Article

DESCRIPTIVE POWER OF FLOW EXPRESSIONS AND EVENT EXPRESSIONSARAKI T; TSUJINO Y; TOKURA N et al.1980; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 4; PP. 76-83; BIBL. 11 REF.Article

CORRIGENDUM TO OUR PAPER: HOW EXPRESSIONS CAN CODE FOR AUTOMATALOMBARDY, Sylvain; SAKAROVITCH, Jacques.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 3, pp 339-361, issn 0988-3754, 23 p.Article

On the intersection of regex languages with regular languagesCAMPEANU, Cezar; SANTEAN, Nicolae.Theoretical computer science. 2009, Vol 410, Num 24-25, pp 2336-2344, issn 0304-3975, 9 p.Article