A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Information and Computation
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
The regular viewpoint on PA-processes
Theoretical Computer Science
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Associative language descriptions
Theoretical Computer Science
Iterated relabeling tree transducers
Theoretical Computer Science
Decidability of EDT0L structural equivalence
Theoretical Computer Science
Query automata over finite trees
Theoretical Computer Science
Some Notes on the Formal Properties of Bidirectional Optimality Theory
Journal of Logic, Language and Information
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
One-visit caterpillar tree automata
Fundamenta Informaticae
Uniform and nonuniform recognizability
Theoretical Computer Science
An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
wMSO theories as grammar formalisms
Theoretical Computer Science - Algebraic methods in language processing
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The MSO Logic-Automaton Connection in Linguistics
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Delta Operation: From Strings to Trees to Strings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
On the Power of Tree-Walking Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Experiments with Finite Tree Automata in Coq
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Logic as a Query Language: From Frege to XML
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
TREEBAG - a Short Presentation
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Generalising Automaticity to Modal Properties of Finite Structures
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Computing Raster Images from Grid Picture Grammars
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Regularly Extended Two-Way Nondeterministic Tree Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Well-Founded Recursive Relations
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Higher-Order Positive Set Constraints
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Exponential Output Size of Top-Down Tree Transducers
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
The delta operation: from strings to trees to strings
Formal and natural computing
A Web odyssey: from codd to XML
ACM SIGMOD Record
Criteria to disprove context freeness of collage languages
Theoretical Computer Science
On the power of tree-walking automata
Information and Computation - Special issue: ICC '99
Decision procedures for inductive Boolean functions based on alternating automata
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Shape preserving top-down tree transducers
Theoretical Computer Science
HydroJ: object-oriented pattern matching for evolvable distributed systems
OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Derived tree languages of nonassociative Lambek categorial grammars with product
Fundamenta Informaticae
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Computing raster images from grid picture grammars
Journal of Automata, Languages and Combinatorics
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Syntactic composition of top-down tree transducers is short cut fusion
Mathematical Structures in Computer Science
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic (TOCL)
Hierarchies of tree series transformations
Theoretical Computer Science
Lexicalized Tree Automata-based Grammars for translating conversational texts
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Tree operations in P systems and λ-calculus
Fundamenta Informaticae
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Journal of Automata, Languages and Combinatorics
Binary queries for document trees
Nordic Journal of Computing
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
InfoXtract: a customizable intermediate level information extraction engine
SEALTS '03 Proceedings of the HLT-NAACL 2003 workshop on Software engineering and architecture of language technology systems - Volume 8
Linear deterministic multi bottom-up tree transducers
Theoretical Computer Science
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Recognizability, hypergraph operations, and logical types
Information and Computation
Finitely presentable tree series
Acta Cybernetica
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Theoretical Computer Science
Abstract Families of Abstract Categorial Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Using MONA for querying linguistic treebanks
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Weighted tree automata and weighted logics
Theoretical Computer Science
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
Alternating two-way AC-tree automata
Information and Computation
Generalising automaticity to modal properties of finite structures
Theoretical Computer Science
Theoretical Computer Science
Infoxtract: A customizable intermediate level information extraction engine
Natural Language Engineering
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
Electronic Notes in Theoretical Computer Science (ENTCS)
Incomparability results for classes of polynomial tree series transformations
Journal of Automata, Languages and Combinatorics
Compositions of extended top-down tree transducers
Information and Computation
A note on cut-worthiness of recognizable tree series
Fuzzy Sets and Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Minimizing Deterministic Weighted Tree Automata
Language and Automata Theory and Applications
Extended Multi Bottom-Up Tree Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning of Regular ω-Tree Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Pebble alternating tree-walking automata and their recognizing power
Acta Cybernetica
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Translating Multiset Tree Automata into P Systems
Membrane Computing
Circularity, composition, and decomposition results for pebble macro tree transducers
Journal of Automata, Languages and Combinatorics
Deterministic bottom-up tree transducers and ground term rewrite systems
Theoretical Computer Science
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Kleene Theorem for Forest Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
On the Complexity of the Syntax of Tree Languages
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Single-Path Restarting Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Deciding determinism of caterpillar expressions
Theoretical Computer Science
Defining syntax-directed translations by tree bimorphisms
Theoretical Computer Science
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
Minimizing deterministic weighted tree automata
Information and Computation
Definable transductions and weighted logics for texts
Theoretical Computer Science
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Cut sets as recognizable tree languages
Fuzzy Sets and Systems
Recognizability, hypergraph operations, and logical types
Information and Computation
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
Journal of Logic, Language and Information
The specker-blatter theorem revisited
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Branching grammars: a generalization of ET0L systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Alphabetic pushdown tree transducers
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Two-way equational tree automata for AC-like theories: decidability and closure properties
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Cardinality constraints in disjunctive deductive databases
Proceedings of the 2nd international conference on Semantics in databases
Bisimulation minimisation for weighted tree automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Weighted tree-walking automata
Acta Cybernetica
Kleene revisited by Suschkewitsch
Acta Cybernetica
Deterministic caterpillar expressions
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Syntax-directed translations and quasi-alphabetic tree bimorphisms
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
From tree-based generators to delegation networks
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
An algebra for tree-based music generation
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Learning deterministically recognizable tree series: revisited
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
An automata theoretic approach to rational tree relations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Classes of tree homomorphisms with decidable preservation of regularity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Myhill-Nerode theorem for recognizable tree series revisited
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the forty-second ACM symposium on Theory of computing
A tree transducer model for synchronous tree-adjoining grammars
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
A decoder for probabilistic synchronous tree insertion grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Millstream systems: a formal model for linking language modules by interfaces
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Algorithmic properties of millstream systems
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Input products for weighted extended top-down tree transducers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
A sequent calculus with implicit term representation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Compositions of top-down tree transducers with ε-rules
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Varieties of recognizable tree series over fields
Theoretical Computer Science
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
Using regular tree grammars to enhance sentence realisation
Natural Language Engineering
Equational tree transformations
Theoretical Computer Science
Variable tree automata over infinite ranked alphabets
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Pushing for weighted tree automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars
Journal of Logic, Language and Information
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Identifying p rules from membrane structures with an error-correcting approach
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Editing distances between membrane structures
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On tree automata that certify termination of left-linear term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Towards types for web rule languages
Proceedings of the First international conference on Reasoning Web
Alternation in equational tree automata modulo XOR
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Arbology: trees and pushdown automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
State complexity of the concatenation of regular tree languages
Theoretical Computer Science
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Equational weighted tree transformations with discounting
Algebraic Foundations in Computer Science
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
Deterministic recognition of trees accepted by a linear pushdown tree automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
A generalized view on parsing and translation
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences
Project presentation: algorithmic structuring and compression of proofs (ASCOP)
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
The HOM Problem is EXPTIME-Complete
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Unidirectional derivation semantics for synchronous tree-adjoining grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Word automaticity of tree automatic scattered linear orderings is decidable
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
Tree Operations in P Systems and λ-Calculus
Fundamenta Informaticae
Derived Tree Languages of Nonassociative Lambek Categorial Grammars with Product
Fundamenta Informaticae
One-Visit Caterpillar Tree Automata
Fundamenta Informaticae
Distinguishability, Simulation and Universality of Moore Tree Automata
Fundamenta Informaticae
On the Size of Stack and Synchronization Alphabets of Tree Automata
Fundamenta Informaticae
Every sensible extended top-down tree transducer is a multi bottom-up tree transducer
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Hyper-minimization for deterministic tree automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Journal of the ACM (JACM)
Hyper-optimization for deterministic tree automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.03 |