On the public citation graph

N-Ary Queries by Tree Automata

https://doi.org/10.1007/11601524_14
0 signed · 54 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1999.1684openalex-snapshot
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
inferredcites →https://doi.org/10.1007/11547273_1openalex-snapshot
Patterns and Types for Querying XML Documents
inferredcites →https://doi.org/10.1007/11601524_15openalex-snapshot
Minimizing Tree Automata for Unranked Trees
inferredcites →https://doi.org/10.1007/3-540-45681-3_25openalex-snapshot
Information Extraction in Structured Documents Using Tree Automata Induction
inferredcites →https://doi.org/10.1007/978-3-540-25979-4_8openalex-snapshot
Querying Unranked Trees with Stepwise Tree Automata
inferredcites →https://doi.org/10.1007/978-3-540-30195-0_9openalex-snapshot
Learning Node Selecting Tree Transducer from Completely Annotated Examples
inferredcites →https://doi.org/10.1007/978-3-540-49382-2_12openalex-snapshot
Locating Matches of Tree Patterns in Forests
inferredcites →https://doi.org/10.1007/bf00263578openalex-snapshot
On the finite degree of ambiguity of finite tree automata
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1016/0378-7206(85)90014-xopenalex-snapshot
ACM symposium on principles of database systems
inferredcites →https://doi.org/10.1016/s0304-3975(01)00301-2openalex-snapshot
Query automata over finite trees
inferredcites →https://doi.org/10.1017/s0956796802004410openalex-snapshot
Regular expression pattern matching for XML
inferredcites →https://doi.org/10.1109/lics.2002.1029828openalex-snapshot
Monadic queries over tree-structured data
inferredcites →https://doi.org/10.1109/lics.2003.1210058openalex-snapshot
Query evaluation on compressed trees
inferredcites →https://doi.org/10.1145/1055558.1055560openalex-snapshot
The Lixto data extraction project
inferredcites →https://doi.org/10.1145/1055558.1055562openalex-snapshot
Conditional XPath, the first order complete XPath dialect
inferredcites →https://doi.org/10.1145/1065167.1065203openalex-snapshot
XML type checking with macro tree transducers
inferredcites →https://doi.org/10.1145/237661.237673openalex-snapshot
Variable independence and aggregation closure
inferredcites →https://doi.org/10.1145/505241.505245openalex-snapshot
Expressiveness of structured document query languages based on attribute grammars
inferredcites →https://doi.org/10.1145/543613.543617openalex-snapshot
Monadic datalog and the expressive power of languages for web information extraction
inferredcites →https://doi.org/10.1145/937555.937557openalex-snapshot
Variable independence for first-order definable constraints

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11523468_4openalex-snapshot
Logics for Unranked Trees: An Overview
inferred← citeshttps://doi.org/10.1007/11591191_16openalex-snapshot
Matching with Regular Constraints
inferred← citeshttps://doi.org/10.1007/11872436_21openalex-snapshot
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
inferred← citeshttps://doi.org/10.1007/11965893_25openalex-snapshot
Combining Temporal Logics for Querying XML Documents
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_29openalex-snapshot
Regular n-ary Queries in Trees and Variable Independence
inferred← citeshttps://doi.org/10.1007/978-3-319-04939-7_13openalex-snapshot
View-Based Tree-Language Rewritings for XML
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_13openalex-snapshot
Satisfiability of a Spatial Logic with Tree Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_25openalex-snapshot
Tree Automata with Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_7openalex-snapshot
Reasoning about XML with Temporal Logics and Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_16openalex-snapshot
A Rewrite Approach for Pattern Containment
inferred← citeshttps://doi.org/10.1007/s00200-009-0106-4openalex-snapshot
Simplifying the signature in second-order unification
inferred← citeshttps://doi.org/10.1007/s10994-006-9613-8openalex-snapshot
Interactive learning of node selecting tree transducer
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.021openalex-snapshot
Linear delay enumeration and monadic second-order logic
inferred← citeshttps://doi.org/10.1016/j.ic.2010.08.003openalex-snapshot
Queries on Xml streams with bounded delay and concurrency
inferred← citeshttps://doi.org/10.1016/j.jal.2009.09.005openalex-snapshot
Reasoning about XML with temporal logics and automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.003openalex-snapshot
Automata for XML—A survey
inferred← citeshttps://doi.org/10.1145/2603088.2603137openalex-snapshot
MSO queries on trees
inferred← citeshttps://doi.org/10.1145/2933575.2935315openalex-snapshot
Two-Way Visibly Pushdown Automata and Transducers
inferred← citeshttps://doi.org/10.1145/3040488openalex-snapshot
Monadic Decomposition
inferred← citeshttps://doi.org/10.1145/3209108.3209144openalex-snapshot
MSO Queries on Trees
inferred← citeshttps://doi.org/10.1145/3209108.3209181openalex-snapshot
Logics for Word Transductions with Synthesis
inferred← citeshttps://doi.org/10.14778/1920841.1920954openalex-snapshot
XPath whole query optimization
inferred← citeshttps://doi.org/10.1587/transinf.2014fcp0014openalex-snapshot
Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.2168/lmcs-2(3:2)2006openalex-snapshot
Logics for Unranked Trees: An Overview
inferred← citeshttps://doi.org/10.2197/ipsjjip.23.716openalex-snapshot
Design and Implementation of a Java Bytecode Manipulation Library for Clojure
inferred← citeshttps://doi.org/10.3233/fi-2009-0072openalex-snapshot
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach
inferred← citeshttps://doi.org/10.4204/eptcs.134.4openalex-snapshot
Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.4204/eptcs.134.5openalex-snapshot
XPath Node Selection over Grammar-Compressed Trees
inferred← citeshttps://doi.org/10.4230/dagsemproc.08261.3openalex-snapshot
A Rewrite Approach for Pattern Containment – Application to Query Evaluation on Compressed Documents
inferred← citeshttps://doi.org/10.5860/choice.48-6328openalex-snapshot
Foundations of XML processing: the tree-automata approach
inferred← citeshttps://doi.org/10.70675/103d5ffaz8ac1z4734z8baez06115519a946openalex-snapshot
Définissabilité et synthèse de transductions
inferred← citeshttps://doi.org/10.70675/8702e515zeee2z4b1az9602z60684592e22aopenalex-snapshot
Induction de requêtes guidée par schéma
inferred← citeshttps://doi.org/10.70675/98022161z28f5z45a8za356z714fd4718e68openalex-snapshot
Tree automata with global constraints for the verification of security properties
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.