On the public citation graph

Learning Regular Expressions from Noisy Sequences

https://doi.org/10.1007/11527862_7
0 signed · 29 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.1007/3-540-48050-1_41openalex-snapshot
Recognizing and Discovering Complex Events in Sequences
inferredcites →https://doi.org/10.1007/3-540-63577-7_39openalex-snapshot
Learning DFA from simple examples
inferredcites →https://doi.org/10.1007/bf00114841openalex-snapshot
Learning automata from ordered examples
inferredcites →https://doi.org/10.1007/bf00114844openalex-snapshot
Distributed representations, simple recurrent networks, and grammatical structure
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1007/bf02458834openalex-snapshot
Approximate matching of regular expressions
inferredcites →https://doi.org/10.1007/bfb0054062openalex-snapshot
A polynomial time incremental algorithm for learning DFA
inferredcites →https://doi.org/10.1016/b978-0-323-89775-4.00003-1openalex-snapshot
Biological sequence analysis
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1017/cbo9780511790492openalex-snapshot
Biological Sequence Analysis
inferredcites →https://doi.org/10.1023/a:1007469218079openalex-snapshot
The Hierarchical Hidden Markov Model: Analysis and Applications
inferredcites →https://doi.org/10.1023/a:1010822518073openalex-snapshot
Learning DFA from Simple Examples
inferredcites →https://doi.org/10.1023/a:1010826628977openalex-snapshot
Learning Regular Languages from Simple Positive Examples
inferredcites →https://doi.org/10.1109/34.57687openalex-snapshot
Inference of k-testable languages in the strict sense and application to syntactic pattern recognition
inferredcites →https://doi.org/10.1109/icpr.1994.576922openalex-snapshot
An EM approach to grammatical inference: input/output HMMs
inferredcites →https://doi.org/10.1109/proc.1983.12755openalex-snapshot
Syntactic pattern recognition and applications
inferredcites →https://doi.org/10.1109/tsmc.1975.5409159openalex-snapshot
Grammatical Inference: Introduction and Survey - Part I
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11875604_47openalex-snapshot
A Methodological Contribution to Music Sequences Analysis
inferred← citeshttps://doi.org/10.1016/b978-0-12-396535-6.00004-1openalex-snapshot
Machine Learning and Event-Based Software Testing: Classifiers for Identifying Infeasible GUI Event Sequences
inferred← citeshttps://doi.org/10.1109/embc44109.2020.9176503openalex-snapshot
An Empirical Method of Automatic Pattern Extraction for Clinical Text Classification
inferred← citeshttps://doi.org/10.1109/icstw.2011.73openalex-snapshot
Identifying Infeasible GUI Test Cases Using Support Vector Machines and Induced Grammars
inferred← citeshttps://doi.org/10.1142/s0218194020400203openalex-snapshot
Regular Expression Learning from Positive Examples Based on Integer Programming
inferred← citeshttps://doi.org/10.1145/2016039.2016069openalex-snapshot
Efficient schema extraction from a large collection of XML documents
inferred← citeshttps://doi.org/10.1145/2676726.2676973openalex-snapshot
Program Boosting
inferred← citeshttps://doi.org/10.1145/2775051.2676973openalex-snapshot
Program Boosting
inferred← citeshttps://doi.org/10.1145/3180445.3180446openalex-snapshot
Regex-Based Linkography Abstraction Refinement for Information Security
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25606openalex-snapshot
A Noise-Tolerant Differentiable Learning Approach for Single Occurrence Regular Expression with Interleaving
inferred← citeshttps://doi.org/10.3115/1613715.1613719openalex-snapshot
Regular expression learning for information extraction
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.