Gregory Kucherov, Michaël Rusinowitch  Home/Search
Context
Related
| loria.fr/~kucherov/P...KuchRusiPSI99.ps loria.fr/~rusi/pub/novosib.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: loria.fr/~kucherov/res_activ (more) From: loria.fr/~rusi/publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we study some natural problems related to specifying sets of words and trees by patterns. (Update)
Active bibliography (related documents): More All
1.4: The Complexity of Some Complementation Problems - Plaisted, Kucherov (1998) (Correct)
0.8: The complete list of RTA open problems - Date April Summary (Correct)
0.7: On Deciding Subsumption Problems - Egly, Pichler, Woltran (2003) (Correct)
Similar documents based on text: More All
0.4: Multi-Seed Lossless Filtration (Extended Abstract) - Kucherov, Noe, Roytberg (Correct)
0.2: Matching a Set of Strings with Variable Length Don't Cares - Kucherov, Rusinowitch (1995) (Correct)
0.2: The Complexity of Testing Ground Reducibility for Linear.. - Kucherov, Rusinowitch (1995) (Correct)
BibTeX entry: (Update)
@article{ kucherov00patterns,
author = "Gregory Kucherov and Micha{\"e}l Rusinowitch",
title = "Patterns in Words versus Patterns in Trees: {A} Brief Survey and New Results",
journal = "Lecture Notes in Computer Science",
volume = "1755",
pages = "283--??",
year = "2000",
url = "citeseer.ist.psu.edu/359123.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
686 A guide to the theory of NP-completeness (context) - Garey, Johnson et al. - 1979
142 Finding patterns common to a set of strings (context) - Angluin - 1980
121 Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud - 1990
67 Tree automata (context) - ecseg, Steinby - 1984
36 Avoidable patterns in strings of symbols (context) - Bean, Ehrenfeucht et al. - 1979
34 Automatic proofs by induction in theories without constructo.. (context) - Jouannaud, Kounalis - 1989
23 Open problems in rewriting - Dershowitz, Jouannaud et al. - 1991
20 ground-reducibility and their complexity (context) - Kapur, Narendran et al. - 1991
20 Pattern matching in trees (context) - Ho, O'Donnell - 1982
19 Open problems in pattern avoidance (context) - Currie - 1993
19 Theoretical Computer Science (context) - Kari, Mateescu et al. - 1995
19 Ground reducibility is EXPTIME-complete - Comon, Jacquemard - 1997
18 Inclusion is undecidable for pattern languages (context) - Jiang, Salomaa et al. - 1993
17 Tree pattern matching and subset matching in deterministic o - Cole, Hariharan et al. - 1999
13 Nonlinear pattern matching in trees (context) - Ramesh, Ramakrishnan - 1992
13 On relationship between term rewriting systems and regular t.. (context) - Kucherov - 1991
8 Decidability of regularity and related properties of ground .. - Kucherov, Tajine - 1992
8 Decidability of regularity and related properties of ground .. - Kucherov, Tajine - 1995
7 The relation of two patterns with comparable languages (context) - Fil - 1988
7 Undecidability of ground reducibility for word rewriting sys.. - Kucherov, Rusinowitch - 1995
7 Explicit representation of terms dened by counter examples (context) - Lassez, Marriot - 1987
5 Computing linearizations using test sets (context) - Hofbauer, Huber - 1992
5 Institut Polytechnique de Grenoble (context) - Comon, disunication et al. - 1988
4 On sucient completeness and related properties of term rewri.. (context) - Kapur, Narendran et al. - 1987
4 Working with ARMs: Complexity results on atomic representati.. (context) - Gottlob, Pichler - 1999
4 Complexity of testing ground reducibility for linear word re.. - Kucherov, Rusinowitch - 1995
3 Studies in Computer Science and Articial Intelligence (context) - Nivat, Podelski et al. - 1992
3 and time-space ecient string searching (context) - Crochemore, Rytter et al. - 1995
3 Nondeterminism in patterns (context) - Mateescu, Salomaa - 1994
2 Semantic con uence and completion method (context) - Plaisted - 1985
2 es dans les mots (context) - Cassaigne, evitables et al. - 1994
2 The explicit representability of implicit generalizations (context) - Pichler - 1999
1 The complexity of some complementation problems - Kucherov, Plaisted - 1998
1 Detecting morphic images of a word: On the rank of a pattern (context) - eraud - 1995
1 a rewriting system it is decidable whether the set of irredu.. (context) - agv, Gilleron - 1992
1 Polynomial time inference of pattern langages and its applic.. (context) - Shinohara - 1982
Documents on the same site (http://www.loria.fr/~kucherov/res_activ.html): More
How to Get Rid of Projection Rules in Context-free Tree.. - Hofbauer, Huber, Kucherov (Correct)
Undecidability of Ground Reducibility for Word Rewriting.. - Kucherov, RUSINOWITCH (1995) (Correct)
On Repetition-Free Binary Words of Minimal Density.. - Kolpakov, Kucherov.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC