Gene assembly in ciliates: computing by folding and recombination
A half-century of automata theory
Theoretical Computer Science
Fast Algorithms for Extended Regular Expression Matching and Searching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Forbidden Factors and Fragment Assembly
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Computing the Equation Automaton of a Regular Expression in Space and Time
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
An algorithm for analysis of images in spatial information systems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Language equations, maximality and error-detection
Journal of Computer and System Sciences
Information Processing Letters
On properties of bond-free DNA languages
Theoretical Computer Science
The wide window string matching algorithm
Theoretical Computer Science
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Prefix-free regular languages and pattern matching
Theoretical Computer Science
Pattern Matching in DCA Coded Text
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Combinatorics of Finite Words and Suffix Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Information Processing Letters
Suffix automata and standard sturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On the suffix automaton with mismatches
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A framework for benchmarking FA-based string recognizers
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Computing maximal Kleene closures that are embeddable in a given constrained DNA language
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Succinct text indexes on large alphabet
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Finding common motifs with gaps using finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Prefix-Free regular-expression matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
A new linearizing restriction in the pattern matching problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On two-dimensional pattern matching by finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
A note on sequential rule-based POS tagging
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
A fast string search algorithm for deep packet classification
Computer Communications
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Fast Data Compression with Antidictionaries
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Theoretical Computer Science
Computing maximal Kleene closures that are embeddable in a given subword-closed language
Natural Computing: an international journal
Efficient representation of DNA data for pattern recognition using failure factor oracles
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
| Hi-index | 0.01 |