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 note on pure codesHUANG, C. C.Acta informatica. 2010, Vol 47, Num 5-6, pp 347-357, issn 0001-5903, 11 p.Article

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

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

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

Duration-constrained regular expressionsLI XUANDONG; ZHAO JIANHUA; ZHENG TAO et al.Formal aspects of computing. 2004, Vol 16, Num 2, pp 155-163, issn 0934-5043, 9 p.Conference Paper

A coalgebraic approach to Kleene algebra with testsHUBIE CHEN; PUCELLA, Riccardo.Theoretical computer science. 2004, Vol 327, Num 1-2, pp 23-44, issn 0304-3975, 22 p.Conference Paper

An implementation of subtyping among regular expression typesZHUO MING LU, Kenny; SULZMANN, Martin.Lecture notes in computer science. 2004, pp 57-73, issn 0302-9743, isbn 3-540-23724-0, 17 p.Conference Paper

Algorithms for computing small NFAsILIE, Lucian; SHENG YU.Lecture notes in computer science. 2002, pp 328-340, issn 0302-9743, isbn 3-540-44040-2, 13 p.Conference Paper

Brzozowski's derivatives extended to multiplicitiesCHAMPARNAUD, Jean-Marc; DUCHAMP, Gérard.Lecture notes in computer science. 2002, pp 52-64, issn 0302-9743, isbn 3-540-00400-9, 13 p.Conference Paper

Fair expressions and regular languages over listsBREVEGLIERI, L.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 1, pp 15-66, issn 0988-3754Article

Proof of correctness of a direct construction of DFA from regular expressionRAMESH BABU, S; SANYAL, A; VENKATESH, G et al.International journal of computer mathematics. 1997, Vol 64, Num 3-4, pp 191-210, issn 0020-7160Article

Regular expressions into finite automataBRÜGGEMANN-KLEIN, A.Theoretical computer science. 1993, Vol 120, Num 2, pp 197-213, issn 0304-3975Article

Saving time with regular expressionsBEALLE, John.Indexer. 2011, Vol 29, Num 2, pp 70-72, issn 0019-4131, 3 p.Article

TOOLS FOR VERY FAST REGULAR EXPRESSION MATCHINGPASETTO, Davide; PETRINI, Fabrizio; AGARWAL, Virat et al.Computer (Long Beach, CA). 2010, Vol 43, Num 3, pp 50-58, issn 0018-9162, 9 p.Article

LCGMiner : Levelwise closed graph pattern mining from large databasesAIHUA XU; HANSHENG LEI.International conference on scientific and statistical database management. 2004, pp 421-422, isbn 0-7695-2146-0, 1Vol, 2 p.Conference Paper

Early evaluating XML trees in object repositoriesPARK, Sangwon.Lecture notes in computer science. 2006, pp 58-67, issn 0302-9743, isbn 3-540-31158-0, 1Vol, 10 p.Conference Paper

A pruning technique to discover correlated sequential patterns in retail databasesYUN, Unil.Lecture notes in computer science. 2006, pp 1032-1036, issn 0302-9743, isbn 3-540-49787-0, 1Vol, 5 p.Conference Paper

Acyclic Automata with Easy-to-Find Short Regular ExpressionsMORAIS, José Joao; MOREIRA, Nelina; REIS, Rogério et al.Lecture notes in computer science. 2006, pp 349-350, issn 0302-9743, isbn 3-540-31023-1, 1Vol, 2 p.Conference Paper