On the public citation graph
A polynomial time algorithm for finding finite unions of tree pattern languages
0 signed · 35 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/3-540-17179-7_6openalex-snapshot
Explicit representation of terms defined by counter examples
inferredcites →https://doi.org/10.1007/3-540-51734-0_50openalex-snapshot
Inductive inference, DFAs, and computational complexity
inferredcites →https://doi.org/10.1007/bf00243794openalex-snapshot
Explicit representation of terms defined by counter examples
inferredcites →https://doi.org/10.1007/bf03037093openalex-snapshot
Polynomial-time inference of arbitrary pattern languages
inferredcites →https://doi.org/10.1016/0022-0000(80)90041-0openalex-snapshot
Finding patterns common to a set of strings
inferredcites →https://doi.org/10.1016/b978-0-08-094829-4.50026-xopenalex-snapshot
IDENTIFICATION OF UNIONS OF LANGUAGES DRAWN FROM AN IDENTIFIABLE CLASS
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50018-xopenalex-snapshot
Logic Programming and Parallel Complexity
inferredcites →https://doi.org/10.1016/s0019-9958(80)90285-5openalex-snapshot
Inductive inference of formal languages from positive data
inferredcites →https://doi.org/10.1145/800135.804406openalex-snapshot
Finding patterns common to a set of strings (Extended Abstract)
inferredcites →https://doi.org/10.5109/13347openalex-snapshot
INFERRING UNIONS OF TWO PATTERN LANGUAGES
inferredcites →https://doi.org/10.5555/93335.93373openalex-snapshot
Identification of unions of languages drawn from an identifiable class
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11872436_25openalex-snapshot
Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses
inferred← citeshttps://doi.org/10.1007/3-540-36187-1_46openalex-snapshot
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_13openalex-snapshot
Conceptual Classifications Guided by a Concept Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_32openalex-snapshot
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_178openalex-snapshot
Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_74openalex-snapshot
Finding tree patterns consistent with positive and negative examples using queries
inferred← citeshttps://doi.org/10.1007/3-540-60454-5_29openalex-snapshot
Learning unions of tree patterns using queries
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_13openalex-snapshot
Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_25openalex-snapshot
Exact Learning of Finite Unions of Graph Patterns from Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_8openalex-snapshot
Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-89378-3_51openalex-snapshot
Evolution of Multiple Tree Structured Patterns from Tree-Structured Data Using Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-14888-0_27openalex-snapshot
Learning from Positive Data Based on the MINL Strategy with Refinement Operators
inferred← citeshttps://doi.org/10.1007/s10472-015-9458-6openalex-snapshot
Learning concepts and their unions from positive data with refinement operators
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.028openalex-snapshot
Developments from enquiries into the learnability of the pattern languages from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00015-7openalex-snapshot
Learning unions of tree patterns using queries
inferred← citeshttps://doi.org/10.1023/a:1018912223866openalex-snapshot
Finding tree patterns consistent with positive and negative examples using queries
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.2.222openalex-snapshot
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
inferred← citeshttps://doi.org/10.1109/iccae.2010.5451349openalex-snapshot
Evolution of multiple tree structured patterns using soft clustering
inferred← citeshttps://doi.org/10.1109/iwcia.2014.6988088openalex-snapshot
Acquisition of characteristic sets of tree patterns with VLDC's using genetic programming and edit distance
inferred← citeshttps://doi.org/10.2197/ipsjtrans.2.250openalex-snapshot
Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries
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.