Pattern expressions and pattern automata

Authors:
Cezar Câmpeanu;Sheng Yu
Affiliations:
Department of Mathematics and Computer Science, UPEI, Charlottetown, PE, Canada C1A 4P3;Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 2

Formal languages

Formal languages
Mastering regular expressions

Mastering regular expressions
Regular languages

Handbook of formal languages, vol. 1
Minimization algorithms for sequential transducers

Theoretical Computer Science
Perl: The Programmer's Companion

Perl: The Programmer's Companion
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Regular languages with variables on graphs

Information and Computation
Inside the class of REGEX languages

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of languages, similar to those of extended regex languages [Campeanu et al., Int. J. Found. Comput. Sci. 14 (6) (2003) 1007-1018]. We also define an automata system that recognizes these languages. Differences between regex and pattern expressions are also discussed.