STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Some properties of recognizable L-subsets
Theoretical Computer Science
The limitedness problem on distance automata: Hashiguchi's method revisited
Theoretical Computer Science
On factorization forests of finite height
Theoretical Computer Science
XPath evaluation in linear time
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Height of Factorization Forests
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Universality of R-automata with Value Copying
Electronic Notes in Theoretical Computer Science (ENTCS)
Equations Defining the Polynomial Closure of a Lattice of Regular Languages
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
The common fragment of ACTL and LTL
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
ACM Transactions on Database Systems (TODS)
Efficient evaluation of nondeterministic automata using factorization forests
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Green's relations and their use in automata theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Algorithms for regular languages that use algebra
ACM SIGMOD Record
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Factorisation forests for infinite words application to countable scattered linear orderings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A combinatorial theorem for trees applications to monadic logic and infinite structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |