On the public citation graph

A beam search algorithm for PFSA inference

https://doi.org/10.1007/bf01237940
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-53504-7_63openalex-snapshot
Classification by minimum-message-length inference
inferredcites →https://doi.org/10.1007/978-94-009-3961-5_19openalex-snapshot
Updating Inductive Inference
inferredcites →https://doi.org/10.1007/bf00115299openalex-snapshot
Using the Minimum Description Length Principle to Infer Reduced Ordered Decision Graphs
inferredcites →https://doi.org/10.1016/0005-1098(78)90005-5openalex-snapshot
Modeling by shortest data description
inferredcites →https://doi.org/10.1016/0031-3203(88)90053-2openalex-snapshot
Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships
inferredcites →https://doi.org/10.1016/b978-0-12-696202-4.50018-8openalex-snapshot
Grammatical Inference Techniques in Pattern Analysis
inferredcites →https://doi.org/10.1016/s0020-7373(76)80005-3openalex-snapshot
Behaviour/structure transformations under uncertainty
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0135681-9openalex-snapshot
Linear Automaton Transformations
inferredcites →https://doi.org/10.1093/comjnl/11.2.185openalex-snapshot
An Information Measure for Classification
inferredcites →https://doi.org/10.1109/tc.1972.5009015openalex-snapshot
On the Synthesis of Finite-State Machines from Samples of Their Behavior
inferredcites →https://doi.org/10.1109/tpami.1981.4767078openalex-snapshot
A New Heuristic for Inferring Regular Grammars
inferredcites →https://doi.org/10.1109/tsmc.1980.4308394openalex-snapshot
Regular Inference with a Tail-Clustering Method
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/1013718.237523openalex-snapshot
Foundations of computer science
inferredcites →https://doi.org/10.21236/ad0692390openalex-snapshot
GRAMMATICAL COMPLEXITY AND INFERENCE
inferredcites →https://doi.org/10.48550/arxiv.cmp-lg/9708007openalex-snapshot
A complexity measure for diachronic Chinese phonology

What points at this work

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

inferred← citeshttps://doi.org/10.1109/acsc.2001.906625openalex-snapshot
Inference of regular languages using model simplicity
inferred← citeshttps://doi.org/10.1109/ccc.2019.000-5openalex-snapshot
MML Inference of Hierarchical Probabilistic Finite State Machine
inferred← citeshttps://doi.org/10.1109/icapr.2015.7050655openalex-snapshot
MML inference of Finite State Automata for probabilistic spam detection
inferred← citeshttps://doi.org/10.1109/iceccs.2005.25openalex-snapshot
Behavior Capture and Test: Automated Analysis of Component Integration
inferred← citeshttps://doi.org/10.1109/sp.2009.14openalex-snapshot
Prospex: Protocol Specification Extraction
inferred← citeshttps://doi.org/10.1109/wcre.2006.47openalex-snapshot
QUARK: Empirical Assessment of Automaton-based Specification Miners
inferred← citeshttps://doi.org/10.1111/1467-8640.00218openalex-snapshot
Inductive Inference by Using Information Compression
inferred← citeshttps://doi.org/10.1145/503272.503275openalex-snapshot
Mining specifications
inferred← citeshttps://doi.org/10.1145/563857.563814openalex-snapshot
Using finite state automata for sequence mining
inferred← citeshttps://doi.org/10.14778/3489496.3489510openalex-snapshot
Answering regular path queries through exemplars
inferred← citeshttps://doi.org/10.18419/opus-3443openalex-snapshot
Enriched tool support for Probabilistic Specification Mining (ProSpecMi)
inferred← citeshttps://doi.org/10.21236/ada449063openalex-snapshot
An Architecture for Generating Semantics-Aware Signatures
inferred← citeshttps://doi.org/10.5555/545564.545573openalex-snapshot
Inference of regular languages using model simplicity
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.