Algebraic tools for the concatenation product
Theoretical Computer Science
Star-Free Open Languages and Aperiodic Loops
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Decidable Hierarchies of Starfree Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Piecewise and Local Threshold Testability of DFA
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Some complexity results for polynomial rational expressions
Theoretical Computer Science
Bilateral locally testable languages
Theoretical Computer Science
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
Theoretical Computer Science
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
Constructing divisions into power groups
Theoretical Computer Science
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Kernel methods for learning languages
Theoretical Computer Science
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Hierarchies of Piecewise Testable Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Polynomial Operators on Classes of Regular Languages
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Regularity Results for FIFO Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
A package TESTAS for checking some kinds of testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Locally commutative categories
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Learning languages with rational kernels
COLT'07 Proceedings of the 20th annual conference on Learning theory
Estimating strictly piecewise distributions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
On languages piecewise testable in the strict sense
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Efficient reconstruction of RC-equivalent strings
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Tier-based strictly local constraints for phonology
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
An algebraic characterization of strictly piecewise languages
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
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
Learning linearly separable languages
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Groupoids that recognize only regular languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A linear algorithm for string reconstruction in the reverse complement equivalence model
Journal of Discrete Algorithms
Lattices of logical fragments over words
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Descriptional complexity of biautomata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Biautomata for k-piecewise testable languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
On the state and computational complexity of the reverse of acyclic minimal DFAs
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On the learnability of shuffle ideals
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Efficient separability of regular languages by subsequences and suffixes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Regular languages and partial commutations
Information and Computation
On the learnability of shuffle ideals
The Journal of Machine Learning Research
| Hi-index | 0.01 |