Explicit representation of terms defined by counter examples
Journal of Automated Reasoning
Automatic proofs by induction in theories without constructors
Information and Computation
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica
On relationship between term rewriting systems and regular tree languages
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Nonlinear pattern matching in trees
Journal of the ACM (JACM)
Theoretical Computer Science
Undecidability of ground reducibility for word rewriting systems with variables
Information Processing Letters
Decidability of regularity and related properties of ground normal form languages
Information and Computation
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Tree Automata and Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Inclusion is Undecidable for Pattern Languages
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
The Relation of Two Patterns with Comparable Languages
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Computing Linearizations Using Test Sets
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Decidability of Regularity and Related Properties of Ground Normal Form Languages
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Ground Reducibility is EXPTIME-complete
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Working with Arms: Complexity Results on Atomic Representations of Herbrand Models
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A note on the complexity of matching patterns with variables
Information Processing Letters
Excessively duplicating patterns represent non-regular languages
Information Processing Letters
| Hi-index | 0.00 |
In this paper we study some natural problems related to specifying sets of words and trees by patterns.