On the public citation graph
Minimizing Tree Automata for Unranked Trees
0 signed · 62 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11537311_7openalex-snapshot
Deterministic Automata on Unranked Trees
inferredcites →https://doi.org/10.1007/11601524_13openalex-snapshot
Efficient Memory Representation of XML Documents
inferredcites →https://doi.org/10.1007/3-540-46093-4_1openalex-snapshot
Typechecking for Semistructured Data
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-30570-5_5openalex-snapshot
Which XML Schemas Admit 1-Pass Preorder Typing?
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-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/b978-0-12-046370-1.50009-7openalex-snapshot
On Recognizable Sets and Tree Automata
inferredcites →https://doi.org/10.1016/j.tcs.2004.03.070openalex-snapshot
Minimizing finite automata is computationally hard
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.035openalex-snapshot
On the complexity of typechecking top-down XML transformations
inferredcites →https://doi.org/10.1016/s0019-9958(78)90562-4openalex-snapshot
Complexity of automaton identification from given data
inferredcites →https://doi.org/10.1016/s0022-0000(67)80022-9openalex-snapshot
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
inferredcites →https://doi.org/10.1016/s0022-0000(74)80046-2openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1016/s0304-3975(01)00301-2openalex-snapshot
Query automata over finite trees
inferredcites →https://doi.org/10.1109/lics.2003.1210058openalex-snapshot
Query evaluation on compressed trees
inferredcites →https://doi.org/10.1137/0214044openalex-snapshot
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
inferredcites →https://doi.org/10.1137/0219027openalex-snapshot
Deciding Equivalence of Finite Tree Automata
inferredcites →https://doi.org/10.1142/9789812797902_0004openalex-snapshot
INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME
inferredcites →https://doi.org/10.1142/s012905410200100xopenalex-snapshot
UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
inferredcites →https://doi.org/10.1145/1042046.1042050openalex-snapshot
Incremental validation of XML documents
inferredcites →https://doi.org/10.1145/1055558.1055563openalex-snapshot
Frontiers of tractability for typechecking simple XML transformations
inferredcites →https://doi.org/10.1145/1059513.1059520openalex-snapshot
The complexity of XPath query evaluation and XML typing
inferredcites →https://doi.org/10.1145/1111627.1111631openalex-snapshot
Taxonomy of XML schema languages using formal language theory
inferredcites →https://doi.org/10.1145/1166074.1166076openalex-snapshot
Expressiveness and complexity of XML Schema
inferredcites →https://doi.org/10.1145/335168.335173openalex-snapshot
DTD inference for views of XML data
inferredcites →https://doi.org/10.1145/335168.335217openalex-snapshot
Expressive and efficient pattern languages for tree-structured data (extended abstract)
inferredcites →https://doi.org/10.1145/601858.601869openalex-snapshot
Automata theory for XML researchers
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
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/11872436_21openalex-snapshot
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
inferred← citeshttps://doi.org/10.1007/11965893_19openalex-snapshot
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
inferred← citeshttps://doi.org/10.1007/978-3-030-23679-3_7openalex-snapshot
Z-Automata for Compact and Direct Representation of Unranked Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_74openalex-snapshot
Bounded Depth Data Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_15openalex-snapshot
Languages Modulo Normalization
inferred← citeshttps://doi.org/10.1007/978-3-662-48221-6_4openalex-snapshot
Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-Viral Infection Patterns
inferred← citeshttps://doi.org/10.1016/j.ic.2016.07.012openalex-snapshot
Automata for unordered trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.021openalex-snapshot
On the minimization of XML Schemas and tree automata for unranked trees
inferred← citeshttps://doi.org/10.1089/cmb.2015.0168openalex-snapshot
Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human–viral Infection Patterns
inferred← citeshttps://doi.org/10.1145/1142351.1142354openalex-snapshot
Two-variable logic on data trees and XML reasoning
inferred← citeshttps://doi.org/10.1145/1166074.1166076openalex-snapshot
Expressiveness and complexity of XML Schema
inferred← citeshttps://doi.org/10.1145/1276301.1276308openalex-snapshot
Static analysis of XML processing with data values
inferred← citeshttps://doi.org/10.1145/1516512.1516515openalex-snapshot
Two-variable logic on data trees and XML reasoning
inferred← citeshttps://doi.org/10.1145/1516512.1516518openalex-snapshot
Adding nesting structure to words
inferred← citeshttps://doi.org/10.1145/3133886openalex-snapshot
Synthesis of data completion scripts using finite tree automata
inferred← citeshttps://doi.org/10.1145/3158151openalex-snapshot
Program synthesis using abstraction refinement
inferred← citeshttps://doi.org/10.1145/3540250.3559081openalex-snapshot
Improving IDE code inspections with tree automata
inferred← citeshttps://doi.org/10.18653/v1/w19-3104openalex-snapshot
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs
inferred← citeshttps://doi.org/10.2168/lmcs-2(3:1)2006openalex-snapshot
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
inferred← citeshttps://doi.org/10.2168/lmcs-2(3:2)2006openalex-snapshot
Logics for Unranked Trees: An Overview
inferred← citeshttps://doi.org/10.3233/fi-2009-0068openalex-snapshot
Bisimulation Minimisation of Weighted Automata on Unranked Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1707.01469openalex-snapshot
Synthesis of Data Completion Scripts using Finite Tree Automata
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.