Patterns in Words versus Patterns in Trees: A Brief Survey and New Results

In this paper we study some natural problems related to specifying sets of words and trees by patterns.

[1]  Tao Jiang,et al.  Inclusion is Undecidable for Pattern Languages , 1993, ICALP.

[2]  Gilberto Filé.  The Relation of Two Patterns with Comparable Languages , 1988, STACS.

[3]  James D. Currie,et al.  Open problems in pattern avoidance , 1993 .

[4]  Michaël Rusinowitch,et al.  The Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables , 1994, CTRS.

[5]  Andreas Podelski,et al.  Tree Automata and Languages , 1992 .

[6]  Sándor Vágvölgyi,et al.  For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable , 1992, Bull. EATCS.

[7]  Georg Gottlob,et al.  Working with arms: Complexity results on atomic representations of Herbrand models , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[8]  Gregory Kucherov.  On Relationship Between Term Rewriting Systems and Regular Tree Languages , 1991, RTA.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Reinhard Pichler.  The Explicit Representability of Implicit Generalizations , 2000, RTA.

[11]  Gregory Kucherov,et al.  Decidability of Regularity and Related Properties of Ground Normal Form Languages , 1995, Inf. Comput..

[12]  A. Zimin.  BLOCKING SETS OF TERMS , 1984 .

[13]  David A. Plaisted,et al.  The Complexity of Some Complementation Problems , 1999, Inf. Process. Lett..

[14]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[15]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[16]  Florent Jacquemard,et al.  Ground reducibility is EXPTIME-complete , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[17]  Michaël Rusinowitch,et al.  Undecidability of Ground Reducibility for Word Rewriting Systems with Variables , 1995, Inf. Process. Lett..

[18]  Jean-Pierre Jouannaud,et al.  Open Problems in Rewriting , 1991, RTA.

[19]  Richard Cole,et al.  Tree pattern matching and subset matching in deterministic O(n log3 n)-time , 1999, SODA '99.

[20]  Jean-Pierre Jouannaud,et al.  Automatic Proofs by Induction in Theories without Constructors , 1989, Inf. Comput..

[21]  Dieter Hofbauer,et al.  Computing Linearizations Using Test Sets , 1992, CTRS.

[22]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[23]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[24]  I. V. Ramakrishnan,et al.  Nonlinear pattern matching in trees , 1988, JACM.

[25]  Julien Cassaigne.  Motifs evitables et regularites dans les mots , 1994 .

[26]  David A. Plaisted,et al.  Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..

[27]  Dwight R. Bean,et al.  Avoidable patterns in strings of symbols , 1979 .

[28]  Gheorghe Paun,et al.  Multi-Pattern Languages , 1995, Theor. Comput. Sci..

[29]  Arto Salomaa,et al.  Nondeterminism in Patterns , 1994, STACS.