On the public citation graph

A Family of Algorithms for Non Deterministic Regular Languages Inference

0 signed · 25 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/978-3-540-30500-2_37openalex-snapshot
Minimalizations of NFA Using the Universal Automaton
inferredcites →https://doi.org/10.1016/j.tcs.2003.11.008openalex-snapshot
Learning regular languages using RFSAs
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0019-9958(78)90562-4openalex-snapshot
Complexity of automaton identification from given data
inferredcites →https://doi.org/10.1142/1582openalex-snapshot
Pattern Recognition and Image Analysis
inferredcites →https://doi.org/10.1142/9789812797902_0004openalex-snapshot
INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME
inferredcites →https://doi.org/10.1142/s0129054105003431openalex-snapshot
MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-85672-4_20openalex-snapshot
Improved SAT Models for NFA Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-94216-8_14openalex-snapshot
GA and ILS for Optimizing the Size of NFA Models
inferred← citeshttps://doi.org/10.1007/978-3-031-35995-8_10openalex-snapshot
Inference of Over-Constrained NFA of Size $$k+1$$ to Efficiently and Systematically Derive NFA of Size k for Grammar Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-77941-1_21openalex-snapshot
Robust Models for Learning Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-78024-5_25openalex-snapshot
Two Parallelization Schemes for the Induction of Nondeterministic Finite Automata on PCs
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_10openalex-snapshot
Learning Regular Languages Using Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_4openalex-snapshot
On the Inference of Finite State Automata from Positive and Negative Data
inferred← citeshttps://doi.org/10.1016/j.jocs.2024.102309openalex-snapshot
Robust models to infer flexible nondeterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.procs.2016.05.318openalex-snapshot
On Parallel Induction of Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.017openalex-snapshot
Universal automata and NFA learning
inferred← citeshttps://doi.org/10.1017/s1351324911000064openalex-snapshot
A randomised inference algorithm for regular tree languages
inferred← citeshttps://doi.org/10.1063/1.5012490openalex-snapshot
Parallel induction of nondeterministic finite automata revisited
inferred← citeshttps://doi.org/10.1109/ictai56018.2022.00205openalex-snapshot
Taking Advantage of a Very Simple Property to Efficiently Infer NFAs
inferred← citeshttps://doi.org/10.1109/ispdc51135.2020.00015openalex-snapshot
Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm
inferred← citeshttps://doi.org/10.1145/3597503.3623346openalex-snapshot
It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data
inferred← citeshttps://doi.org/10.3233/apc200039openalex-snapshot
On Superlinear Speedups of a Parallel NFA Induction Algorithm
inferred← citeshttps://doi.org/10.4995/thesis/10251/1957openalex-snapshot
Estudio de la mezcla de estados determinista y no determinista en el diseño de algoritmos para inferencia gramatical de lenguajes regulares.
inferred← citeshttps://doi.org/10.5220/0012454100003636openalex-snapshot
Classifying Words with 3-sort 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.