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

ON REGULAR EXPRESSIONS POSSESSING THE EMPTY WORD PROPERTYURPONEN T.1972; ANN. UNIV. TURKU., A1; FINL.; DA. 1972; NO 154; PP. 1-12; BIBL. 2 REF.Serial Issue

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

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

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

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

Modèles de données semi-structurées et contraintes d'inclusion = Model of semi-structured data and inclusion constraintCARON, A. C; DEBARBIEUX, D; ROOS, Y et al.Revue d'intelligence artificielle. 2003, Vol 17, Num 1-3, pp 461-472, issn 0992-499X, 12 p.Conference Paper

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

The membership problem for regular expressions with intersection is complete in LOGCFLPETERSEN, Holger.Lecture notes in computer science. 2002, pp 513-522, issn 0302-9743, isbn 3-540-43283-3Conference Paper

New finite automaton constructions based on canonical derivativesCHAMPARNAUD, Jean-Marc; ZIADI, D.Lecture notes in computer science. 2001, pp 94-104, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Keys with upward wildcards for XMLWENFEI FAN; SCHWENZER, Peter; KUN WU et al.Lecture notes in computer science. 2001, pp 657-667, issn 0302-9743, isbn 3-540-42527-6Conference Paper

Narrowing the narrowing spaceANTOY, S; ARIOLA, Z. M.Lecture notes in computer science. 1997, pp 1-15, issn 0302-9743, isbn 3-540-63398-7Conference Paper

Efficient expansion of factored expressionsGUENTHER, G. R.Information processing letters. 1990, Vol 35, Num 2, pp 69-72, issn 0020-0190Article

A logical approach of Petri net languagesPARIGOT, M; PELZ, E.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 155-169, issn 0304-3975Article