Minimal Covers of Formal Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
On images of DOL and DTOL power series
Theoretical Computer Science
Succinct representations of languages by DFA with different levels of reliability
Theoretical Computer Science - Descriptional complexity of formal systems
State complexity of shuffle on trajectories
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Tradeoffs between reliability and conciseness of deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Periodic and Sturmian languages
Information Processing Letters
Remarks on arbitrary multiple pattern interpretations
Information Processing Letters
Contextual Grammars with Uniform Sets of Trajectories
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Language Decompositions, Primality, and Trajectory-Based Operations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
Maximal error-detecting capabilities of formal languages
Journal of Automata, Languages and Combinatorics
Decimations of languages and state complexity
Theoretical Computer Science
Detecting palindromes, patterns and borders in regular languages
Information and Computation
Periodic and Sturmian languages
Information Processing Letters
An efficient derivation method for DTOL systems and a measure of derivation complexity
Journal of Automata, Languages and Combinatorics
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Contextual Grammars with Uniform Sets of Trajectories
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On a Hierarchy of Slender Languages Based on Control Sets
Fundamenta Informaticae
Hi-index | 0.05 |