Theoretical Computer Science
Attribute grammars: definitions, systems and bibliography
Attribute grammars: definitions, systems and bibliography
Invited talk: automata theory for database theoreticians
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding equivalence of finite tree automata
SIAM Journal on Computing
Theoretical Computer Science
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Information and Computation - Special issue: logic and computational complexity
Algebras for querying text regions: expressive power and optimization
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Temportal connectives versus explicit timestamps to query temporal databases
Journal of Computer and System Sciences
Acta Cybernetica
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Domains of partial attributed tree transducers
Information Processing Letters
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Journal of Computer and System Sciences
Regular expression pattern matching for XML
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A relational model of data for large shared data banks
Communications of the ACM
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
XML with data values: typechecking revisited
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
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
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the power of walking for querying tree-structured data
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Learning XML
Query automata over finite trees
Theoretical Computer Science
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards Regular Languages over Infinite Alphabets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On the Power of Tree-Walking Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Data Model for Document Transformation and Assembly
PODDP '98 Proceedings of the 4th International Workshop on Principles of Digital Document Processing
Applications of Alfred Tarski's Ideas in Database Theory
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
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
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Semistructured Data: From Practice to Theory
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Incremental Validation of XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Logic as a Query Language: From Frege to XML
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Web odyssey: from codd to XML
ACM SIGMOD Record
Databases, but not as we know them
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Journal of Computer and System Sciences
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
The complexity of reasoning about pattern-based XML schemas
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards automatic document migration: semantic preservation of embedded queries
Proceedings of the 2007 ACM symposium on Document engineering
XML data exchange: Consistency and query answering
Journal of the ACM (JACM)
Theoretical Computer Science
Model Checking: From Tools to Theory
25 Years of Model Checking
Tree Automata with Global Constraints
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Tree Pattern Rewriting Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Adding nesting structure to words
Journal of the ACM (JACM)
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
On notions of regularity for data languages
Theoretical Computer Science
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A Note on Two-pebble Automata Over Infinite Alphabets
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Querying parse trees of stochastic context-free grammars
Proceedings of the 13th International Conference on Database Theory
Tree automata over infinite alphabets
Pillars of computer science
On pebble automata for data languages with decidable emptiness problem
Journal of Computer and System Sciences
An automata-theoretic approach to infinite-state systems
Time for verification
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
Combining temporal logics for querying XML documents
ICDT'07 Proceedings of the 11th international conference on Database Theory
Nested pebbles and transitive closure
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
The design space of type checkers for XML transformation languages
ICDT'05 Proceedings of the 10th international conference on Database Theory
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Regular languages with variables on graphs
Information and Computation
WDEE: web data extraction by example
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Highly expressive query languages for unordered data trees
Proceedings of the 15th International Conference on Database Theory
Efficient reasoning about data trees via integer linear programming
ACM Transactions on Database Systems (TODS)
An Automata Model for Trees with Ordered Data Values
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Unranked tree automata with sibling equalities and disequalities
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Containment of pattern-based queries over data trees
Proceedings of the 16th International Conference on Database Theory
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.03 |
We survey some recent developments in the broad area of automata and logic which are motivated by the advent of XML. In particular, we consider unranked tree automata, tree-walking automata, and automata over infinite alphabets. We focus on their connection with logic and on questions imposed by XML.