Journal of the ACM (JACM)
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
The Many Faces of a Translation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On Logical Descriptions of Regular Languages
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Counting Modulo Quantifiers on Finite Linearly Ordered Trees
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Bounded-depth circuits: separating wires from gates
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences
Quasi-star-free languages on infinite words
Acta Cybernetica
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
Languages polylog-time reducible to dot-depth 1/2
Journal of Computer and System Sciences
Circuit Complexity of Regular Languages
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The many faces of a translation
Journal of Computer and System Sciences
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A topological approach to recognition
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Typed monoids: an Eilenberg-like theorem for non regular languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Inexpressibility results for regular languages in nonregular settings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Polylog-time reductions decrease dot-depth
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |