Learnability of a subclass of extended pattern languages
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The expressibility of languages and relations by word equations
Journal of the ACM (JACM)
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Competing Patterns for Language Engineering
TDS '00 Proceedings of the Third International Workshop on Text, Speech and Dialogue
Learning Erasing Pattern Languages with Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
A Negative Result on Inductive Inference of Extended Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
The Problem of Context Sensitive String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Decision lists over regular patterns
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
On the language equivalence of NE star-patterns
Information Processing Letters
A non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Learning erasing pattern languages with queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Subword conditions and subword histories
Information and Computation
Data & Knowledge Engineering
Discontinuities in pattern inference
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Bad News on Decision Problems for Patterns
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Journal of Automata, Languages and Combinatorics
Unambiguous Erasing Morphisms in Free Monoids
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Theoretical Computer Science
On Extended Regular Expressions
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The unambiguity of segmented morphisms
Discrete Applied Mathematics
Bad news on decision problems for patterns
Information and Computation
On the language equivalence of NE star-patterns
Information Processing Letters
The unambiguity of segmented morphisms
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Existence and nonexistence of descriptive patterns
Theoretical Computer Science
Inclusion problems for patterns with a bounded number of variables
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Restricted ambiguity of erasing morphisms
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Algorithms and theory of computation handbook
Restricted ambiguity of erasing morphisms
Theoretical Computer Science
Inferring unions of the pattern languages by the most fitting covers
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
On the equivalence problem for e-pattern languages over small alphabets
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Subwords and Power-Free Words are not Expressible by Word Equations
Fundamenta Informaticae
Inclusion problems for patterns with a bounded number of variables
Information and Computation
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
Proceedings of the 32nd symposium on Principles of database systems
A note on the complexity of matching patterns with variables
Information Processing Letters
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science
| Hi-index | 0.01 |