Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
Existential second-order logic over strings
Journal of the ACM (JACM)
Theoretical Computer Science
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 the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Fast Implementations of Automata Computations
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
A Theory of Restrictions for Logics and Automata
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Second-Order Logic over Strings: Regular and Non-regular Fragments
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
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Automata on Series-Parallel Biposets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Bilateral locally testable languages
Theoretical Computer Science
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Vectorial languages and linear temporal logic
Theoretical Computer Science
Past pushdown timed automata and safety verification
Theoretical Computer Science - Implementation and application automata
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
The finite and the infinite in temporal logic
ACM SIGACT News
Relativizations for the Logic-Automata Connection
Higher-Order and Symbolic Computation
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Quasi-star-free languages on infinite words
Acta Cybernetica
Learning expressions and programs over monoids
Information and Computation
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
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Learning in varieties of the form V*LI from positive data
Theoretical Computer Science
Computability by Sequences of Queries
Fundamenta Informaticae
Acta Cybernetica
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
On Second-Order Monadic Groupoidal Quantifiers
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Games for Temporal Logics on Trees
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Extensional Uniformity for Boolean Circuits
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
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
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Learning expressions and programs over monoids
Information and Computation
The many faces of a translation
Journal of Computer and System Sciences
Extended temporal logic on finite words and wreath product of monoids with distinguished generators
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Locally commutative categories
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of 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
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Estimating strictly piecewise distributions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A topological approach to recognition
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
Typed monoids: an Eilenberg-like theorem for non regular languages
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
Boolean algebras of regular languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A cascade decomposition of weighted finite transition systems
DLT'11 Proceedings of the 15th international conference on Developments in language theory
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Transition function complexity of finite automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On the use of guards for logics with data
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Aural Pattern Recognition Experiments and the Subregular Hierarchy
Journal of Logic, Language and Information
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Restricted two-variable FO + MOD sentences, circuits and communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Model-checking hierarchical structures
Journal of Computer and System Sciences
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Characterizing TC0 in terms of infinite groups
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the expressive power of FO[+]
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Language theoretical properties of hairpin formations
Theoretical Computer Science
Some reducibilities on regular sets
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
C-varieties, actions and wreath product
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Where First-Order and Monadic Second-Order Logic Coincide
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Regular languages of infinite trees that are boolean combinations of open sets
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Lattices of logical fragments over words
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Regularity problems for weak pushdown ω-automata and games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Computability by Sequences of Queries
Fundamenta Informaticae
The Krohn-Rhodes Theorem and Local Divisors
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Linear circuits, two-variable logic and weakly blocked monoids
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the expressiveness of spider diagrams and commutative star-free regular languages
Journal of Visual Languages and Computing
Linear circuits, two-variable logic and weakly blocked monoids
Theoretical Computer Science
| Hi-index | 0.01 |