Pattern expressions and pattern automata

被引：10
|
作者：
Câmpeanu, C
Yu, S [1 ]
机构：
[1] Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada
[2] Univ Prince Edward Isl, Dept Math & Comp Sci, Charlottetown, PE C1A 4P3, Canada
来源：
INFORMATION PROCESSING LETTERS | 2004年 / 92卷 / 06期
关键词：
formal languages; pattern expressions; regex;
D O I：
10.1016/j.ipl.2004.09.007
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 2004 Published by Elsevier B.V.
引用
收藏
页码：267 / 274
页数：8
相关论文
共 50 条
  • [1] Evaluating Linear XPath Expressions by Pattern-Matching Automata
    Silvasti, Panu
    Sippu, Seppo
    Soisalon-Soininen, Eljas
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2010, 16 (05) : 833 - 851
  • [2] A Pattern Logic for Automata with Outputs
    Filiot, Emmanuel
    Mazzocchi, Nicolas
    Raskin, Jean-Francois
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 304 - 317
  • [3] A Pattern Logic for Automata with Outputs
    Filiot, Emmanuel
    Mazzocchi, Nicolas
    Raskin, Jean-Francois
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (06) : 711 - 748
  • [4] PATTERN RECOGNITION IN DESCARTES AUTOMATA
    MORRIS, J
    ISIS, 1969, 60 (204) : 451 - 460
  • [5] An automata approach to pattern collections
    Mielikäinen, T
    KNOWLEDGE DISCOVERY IN INDUCTIVE DATABASES, 2005, 3377 : 130 - 149
  • [6] PATTERN DECOMPOSITION FOR TESSELLATION AUTOMATA
    MARUOKA, A
    KIMURA, M
    THEORETICAL COMPUTER SCIENCE, 1981, 14 (03) : 211 - 226
  • [7] AUTOMATA, COMPUTERS AND PATTERN RECOGNITION - MULTIPLE EXPERIMENTS WITH AUTOMATA
    SPIVAK, MA
    ENGINEERING CYBERNETICS, 1970, 8 (05): : 902 - &
  • [8] Finite automata and pattern avoidance in words
    Brändén, A
    Mansour, T
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2005, 110 (01) : 127 - 145
  • [9] On Tree Pattern Matching by Pushdown Automata
    Flouri, T.
    ACTA POLYTECHNICA, 2009, 49 (02) : 28 - 33
  • [10] Cellular automata and pattern recall: An example
    Voorhees, Burton
    Neural Networks, 1988, 1 (1 SUPPL)
12345