On the public citation graph
Learning automata from ordered examples
0 signed · 59 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.1016/0004-3702(89)90049-0openalex-snapshot
Connectionist learning procedures
inferredcites →https://doi.org/10.1016/0005-1098(72)90033-7openalex-snapshot
System identification via state characterization
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-934613-41-5.50039-8openalex-snapshot
A New Approach to Unsupervised Learning in Deterministic Environments
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.1016/s0019-9958(78)90683-6openalex-snapshot
On the complexity of minimum inference of regular sets
inferredcites →https://doi.org/10.1016/s0019-9958(81)90090-5openalex-snapshot
A note on the number of queries needed to identify regular languages
inferredcites →https://doi.org/10.1016/s0364-0213(82)80001-3openalex-snapshot
Connectionist Models and Their Properties
inferredcites →https://doi.org/10.1109/sfcs.1987.21openalex-snapshot
Diversity-based inference of finite automata
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.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.5555/93025.93114openalex-snapshot
Learning regular languages from counterexamples
inferredcites →https://doi.org/10.7551/mitpress/1716.003.0008openalex-snapshot
Intelligence Without Representation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.1184openalex-snapshot
A polynomial time algorithm to infer sequential machines
inferred← citeshttps://doi.org/10.1007/11527862_7openalex-snapshot
Learning Regular Expressions from Noisy Sequences
inferred← citeshttps://doi.org/10.1007/3-540-56004-1_5openalex-snapshot
Too much information can be too much for learning efficiently
inferred← citeshttps://doi.org/10.1007/3-540-56602-3_137openalex-snapshot
Getting order independence in incremental learning
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_167openalex-snapshot
Online learning versus offline learning
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_34openalex-snapshot
Limits of exact algorithms for inference of minimum size finite state machines
inferred← citeshttps://doi.org/10.1007/978-3-540-24619-0_24openalex-snapshot
P Systems with External Input and Learning Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_13openalex-snapshot
CGE: A Sequential Learning Algorithm for Mealy Automata
inferred← citeshttps://doi.org/10.1007/bf00116034openalex-snapshot
Negative Results for Equivalence Queries
inferred← citeshttps://doi.org/10.1007/bf01007463openalex-snapshot
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata
inferred← citeshttps://doi.org/10.1007/bf03037319openalex-snapshot
Automata for learning sequential tasks
inferred← citeshttps://doi.org/10.1007/bfb0033358openalex-snapshot
An incremental interactive algorithm for regular grammar inference
inferred← citeshttps://doi.org/10.1007/bfb0054002openalex-snapshot
Recursive neural networks and automata
inferred← citeshttps://doi.org/10.1007/bfb0054062openalex-snapshot
A polynomial time incremental algorithm for learning DFA
inferred← citeshttps://doi.org/10.1007/s00236-020-00387-2openalex-snapshot
DKL: an efficient algorithm for learning deterministic Kripke structures
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.1016/s0304-3975(01)00404-2openalex-snapshot
On the power of incremental learning
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00176-7openalex-snapshot
Variants of iterative learning
inferred← citeshttps://doi.org/10.1023/a:1007465907571openalex-snapshot
Online Learning versus Offline Learning
inferred← citeshttps://doi.org/10.1023/a:1014338000161openalex-snapshot
Applying Learning by Examples for Digital Design Automation
inferred← citeshttps://doi.org/10.1080/08839510802164127openalex-snapshot
AN UNSUPERVISED INCREMENTAL LEARNING ALGORITHM FOR DOMAIN-SPECIFIC LANGUAGE DEVELOPMENT
inferred← citeshttps://doi.org/10.1080/09540099308915703openalex-snapshot
Extraction, Insertion and Refinement of Symbolic Rules in Dynamically Driven Recurrent Neural Networks
inferred← citeshttps://doi.org/10.1109/89.985546openalex-snapshot
Automatic generation of subword units for speech recognition systems
inferred← citeshttps://doi.org/10.1109/etfa.2014.7005259openalex-snapshot
Behavioral model synthesis of PLC programs from execution traces
inferred← citeshttps://doi.org/10.1109/icips.1997.669249openalex-snapshot
A qualitative shape model for 2D semi-fractals
inferred← citeshttps://doi.org/10.1109/icst.2012.82openalex-snapshot
Finding the Optimal Balance between Over and Under Approximation of Models Inferred from Execution Logs
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.1109/ms.2007.138openalex-snapshot
Dynamic Detection of COTS Component Incompatibility
inferred← citeshttps://doi.org/10.1109/tnnls.2015.2418323openalex-snapshot
The Kernel Adaptive Autoregressive-Moving-Average Algorithm
inferred← citeshttps://doi.org/10.1109/tse.2010.93openalex-snapshot
Dynamic Analysis for Diagnosing Integration Faults
inferred← citeshttps://doi.org/10.1145/1138912.1138919openalex-snapshot
Inferring state-based behavior models
inferred← citeshttps://doi.org/10.1145/1368088.1368157openalex-snapshot
Automatic generation of software behavioral models
inferred← citeshttps://doi.org/10.1527/tjsai.27.151openalex-snapshot
Generation of Minimum-Consistent DFA Using SAT Solver
inferred← citeshttps://doi.org/10.15623/ijret.2013.0212014openalex-snapshot
COMPUTER AIDED DIAGNOSIS FOR LIVER CANCER USING STATISTICAL MODEL
inferred← citeshttps://doi.org/10.21236/ada236229openalex-snapshot
Image Understanding and Intelligent Parallel Systems
inferred← citeshttps://doi.org/10.26438/ijcse/v6i1.108113openalex-snapshot
Approaches for Efficient Learning Software Models A Survey
inferred← citeshttps://doi.org/10.4204/eptcs.157.10openalex-snapshot
Are There Good Mistakes? A Theoretical Analysis of CEGIS
inferred← citeshttps://doi.org/10.48550/arxiv.1206.2691openalex-snapshot
IDS: An Incremental Learning Algorithm for Finite Automata
inferred← citeshttps://doi.org/10.48550/arxiv.cmp-lg/9405017openalex-snapshot
Best-first Model Merging for Hidden Markov Model Induction
inferred← citeshttps://doi.org/10.9708/jksci.2012.17.3.011openalex-snapshot
Inference of Context-Free Grammars using Binary Third-order Recurrent Neural Networks with Genetic Algorithm
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.