MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Monadic second-order logic on tree-like structures
Theoretical Computer Science
The evaluation of first-order substitution is monadic second-order compatible
Theoretical Computer Science
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Two-Way Finite State Transducers and Monadic Second-Order Logic
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Characterizing and Deciding MSO-Definability of Macro Tree Transductions
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Regular sets of infinite message sequence charts
Information and Computation
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
Recognizability, hypergraph operations, and logical types
Information and Computation
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
Expressiveness and complexity of xml publishing transducers
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Expressiveness and complexity of XML publishing transducers
ACM Transactions on Database Systems (TODS)
Weighted Logics for Nested Words and Algebraic Formal Power Series
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Formal Verification of Graph Grammars using Mathematical Induction
Electronic Notes in Theoretical Computer Science (ENTCS)
Note: Existential MSO over two successors is strictly weaker than over linear orders
Theoretical Computer Science
Definable transductions and weighted logics for texts
Theoretical Computer Science
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Recognizability, hypergraph operations, and logical types
Information and Computation
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On equivalent representations of infinite structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Definable transductions and weighted logics for texts
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Linear orders in the pushdown hierarchy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Graph-transformation verification using monadic second-order logic
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Linear-time algorithms for graphs of bounded rankwidt: a fresh look using game theory
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Minimalist grammars in the light of logic
Logic and grammar
Minimalist tree languages are closed under intersection with recognizable tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
The equivalence problem for deterministic MSO tree transducers is decidable
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Verification of graph grammars using a logical approach
Science of Computer Programming
The modular decomposition of countable graphs: constructions in monadic second-order logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Decidability of MSO theories of tree structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On the structure of linear apex NLC graph grammars
Theoretical Computer Science
Regular Transformations of Infinite Strings
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Clique-width and edge contraction
Information Processing Letters
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
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |