Regular expressions with nested levels of back referencing form a hierarchy

Information Processing Letters

Volumn 65, Issue 4, 1998, Pages 169-172

  Larsen, Kim S ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Back referencing; Formal languages; Regular expressions

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING LANGUAGES; FILE EDITORS;

BACK REFERENCING; REGULAR EXPRESSIONS; SEMANTICS; STANDARD SYNTAX;

FORMAL LANGUAGES;

EID: 0042353691     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00007-6     Document Type: Article

References (5)

1. A.V. Aho, Algorithms for finding patterns in strings, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A, Chapter 5, Algorithms and Complexity, Elsevier, Amsterdam, 1990, pp. 1073-1156.
2. D. Angluin, Finding patterns common to a set of string, in: Proc. 11th Ann. ACM Symp. on Theory of Computing, 1979, pp. 130-141.
3. H.P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1981.
4. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
5. J.C. Martin, Introduction to Languages and the Theory of Computation, McGraw-Hill, New York, 1991.