The membership problem in aperiodic transformation monoids
Journal of the ACM (JACM)
Over words, two variables are as powerful as one quantifier alternation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Existential second-order logic over strings
Journal of the ACM (JACM)
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Theoretical Computer Science
Algebraic tools for the concatenation product
Theoretical Computer Science
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Linear Temporal Logic and Finite Semigroups
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Syntactic Semiring of a Language
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Satisfiability of Systems of Equations over Finite Monoids
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Weakly Iterated Block Products of Finite Monoids
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On Logical Descriptions of Regular Languages
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Star-Free Open Languages and Aperiodic Loops
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Complete Classifications for the Communication Complexity of Regular Languages
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Valuated and Valence Grammars: An Algebraic View
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Automata on Series-Parallel Biposets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Theoretical Computer Science - Mathematical foundations of computer science
The computing power of programs over finite monoids
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Theoretical Computer Science - Latin American theoretical informatics
An algebraic approach to data languages and timed languages
Information and Computation
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
Theoretical Computer Science
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
Computer algebra handbook
Vectorial languages and linear temporal logic
Theoretical Computer Science
Shuffle on positive varieties of languages
Theoretical Computer Science
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
On deterministic finite automata and syntactic monoid size
Theoretical Computer Science - Developments in language theory
Describing syntax with star-free regular expressions
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
Varieties of tree languages definable by syntactic monoids
Acta Cybernetica
Quasi-star-free languages on infinite words
Acta Cybernetica
A hierarchy of shift equivalent sofic shifts
Theoretical Computer Science - Mathematical foundations of computer science 2004
Linear splicing and syntactic monoid
Discrete Applied Mathematics
Actions, wreath products of C-varieties and concatenation product
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Learning in varieties of the form V*LI from positive data
Theoretical Computer Science
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Discrete Applied Mathematics
Regular tree languages and quasi orders
Acta Cybernetica
Small conjunctive varieties of regular languages
Acta Cybernetica
Polynomials, fragments of temporal logic and the variety DA over traces
Theoretical Computer Science
Two algebraic approaches to variants of the concatenation product
Theoretical Computer Science
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Robust Class of Regular Languages
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The Height of Factorization Forests
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Hierarchies of Piecewise Testable Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning Commutative Regular Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Theoretical Computer Science
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Faithful Loops for Aperiodic E-Ordered Monoids
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On locally reversible languages
Theoretical Computer Science
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science
On deterministic finite automata and syntactic monoid size
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On deterministic finite automata and syntactic monoid size, continued
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Locally commutative categories
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Regular and algebraic words and ordinals
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
The expressive power of the shuffle product
Information and Computation
On the Krohn-Rhodes cascaded decomposition theorem
Time for verification
On Schützenberger products of semirings
DLT'10 Proceedings of the 14th international conference on Developments in language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Varieties of recognizable tree series over fields
Theoretical Computer Science
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Typed monoids: an Eilenberg-like theorem for non regular languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Green's relations and their use in automata theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Classifying regular languages via cascade products of automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Languages vs. ω-languages in regular infinite games
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Groupoids that recognize only regular languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Varieties generated by certain models of reversible finite automata
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Schützenberger and eilenberg theorems for words on linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Language theoretical properties of hairpin formations
Theoretical Computer Science
Polynomials, fragments of temporal logic and the variety DA over traces
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Finite automata and unions of regular patterns with bounded constant segments
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
C-varieties, actions and wreath product
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Rough Approximations in Varieties of Regular Languages
Fundamenta Informaticae
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Biautomata for k-piecewise testable languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Burrows-Wheeler transformations and de Bruijn words
Theoretical Computer Science
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
The join levels of the trotter-weil hierarchy are decidable
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Routes and Products of Monoids
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
On the Shuffle of Star-Free Languages
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Factorisation forests for infinite words application to countable scattered linear orderings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Logical refinements of Church's problem
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Regular languages and partial commutations
Information and Computation
| Hi-index | 0.02 |