MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Query automata over finite trees
Theoretical Computer Science
The monadic theory of morphic infinite words and generalizations
Information and Computation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Automata logics, and infinite games
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
On decidability of monadic logic of order over the naturals extended by monadic predicates
Information and Computation
Composition Theorem for Generalized Sum
Fundamenta Informaticae
Arity hierarchy for temporal logics
Theoretical Computer Science
Information and Computation
The Compositional Method and Regular Reachability
Electronic Notes in Theoretical Computer Science (ENTCS)
Composition Theorems for Generalized Sum and Recursively Defined Types
Electronic Notes in Theoretical Computer Science (ENTCS)
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Cardinality quantifiers in MLO over trees
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidable extensions of Church's problem
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Temporal logics over linear time domains are in PSPACE
RP'10 Proceedings of the 4th international conference on Reachability problems
New algorithm for weak monadic second-order logic on inductive structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Decidable expansions of labelled linear orderings
Fields of logic and computation
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Compositional failure detection in structured transition systems
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Temporal logics over linear time domains are in PSPACE
Information and Computation
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A kleene theorem for languages of words indexed by linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
An expressive temporal logic for real time
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Continuous time temporal logic with counting
Information and Computation
Composition Theorem for Generalized Sum
Fundamenta Informaticae
The Church problem for expansions of (N,
Information and Computation
LTL-Model-Checking via model composition
RP'12 Proceedings of the 6th international conference on Reachability Problems
An algebraic proof of Rabin's Tree Theorem
Theoretical Computer Science
Forcing MSO on Infinite Words in Weak MSO
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
From Monadic Second-Order Definable String Transformations to Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |