On the public citation graph
A polynomial time incremental algorithm for learning DFA
0 signed · 39 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-51734-0_50openalex-snapshot
Inductive inference, DFAs, and computational complexity
inferredcites →https://doi.org/10.1007/978-3-642-83462-2_10openalex-snapshot
Learning From Examples in Sequences and Grammatical Inference
inferredcites →https://doi.org/10.1007/bf00114841openalex-snapshot
Learning automata from ordered examples
inferredcites →https://doi.org/10.1007/bfb0033358openalex-snapshot
An incremental interactive algorithm for regular grammar inference
inferredcites →https://doi.org/10.1016/0096-0551(78)90006-1openalex-snapshot
A solution of the syntactical induction-inference problem for regular languages
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-12-737140-5.50007-5openalex-snapshot
A SURVEY OF RESULTS IN GRAMMATICAL INFERENCE
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(81)90090-5openalex-snapshot
A note on the number of queries needed to identify regular languages
inferredcites →https://doi.org/10.1023/a:1010822518073openalex-snapshot
Learning DFA from Simple Examples
inferredcites →https://doi.org/10.1109/tsmc.1975.5409159openalex-snapshot
Grammatical Inference: Introduction and Survey - Part I
inferredcites →https://doi.org/10.1109/tsmc.21openalex-snapshot
IEEE Transactions on Systems, Man, and Cybernetics
inferredcites →https://doi.org/10.1142/9789812797902_0004openalex-snapshot
INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11527862_7openalex-snapshot
Learning Regular Expressions from Noisy Sequences
inferred← citeshttps://doi.org/10.1007/978-1-84628-172-3_8openalex-snapshot
Data Complexity Issues in Grammatical Inference
inferred← citeshttps://doi.org/10.1007/978-3-031-35257-7_16openalex-snapshot
Approximately Learning Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_17openalex-snapshot
On the Relationship between Models for Learning in Helpful Environments
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/978-3-642-15488-1_28openalex-snapshot
Generalizing over Several Learning Settings
inferred← citeshttps://doi.org/10.1007/978-3-642-21768-5_11openalex-snapshot
Incremental Learning-Based Testing for Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-34026-0_36openalex-snapshot
An Incremental Learning Algorithm for Extended Mealy Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-34781-8_16openalex-snapshot
Learning-Based Software Testing: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-662-44994-3_5openalex-snapshot
Inference of Markov Chain Models by Using k-Testable Language: Application on Aging People
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.1007/s00607-012-0214-zopenalex-snapshot
Detecting component changes at run time with behavior models
inferred← citeshttps://doi.org/10.1109/fuzzy.2006.1681964openalex-snapshot
Alignment Based Similarity Measure for Grammar Learning
inferred← citeshttps://doi.org/10.1109/issre.2012.14openalex-snapshot
Revolution: Automatic Evolution of Mined Specifications
inferred← citeshttps://doi.org/10.1109/ms.2007.138openalex-snapshot
Dynamic Detection of COTS Component Incompatibility
inferred← citeshttps://doi.org/10.1109/tac.2018.2793662openalex-snapshot
A Learning-Based Synthesis Approach to the Supremal Nonblocking Supervisor of Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/tase.2017.2693995openalex-snapshot
Integration of Learning-Based Testing and Supervisory Control for Requirements Conformance of Black-Box Reactive Systems
inferred← citeshttps://doi.org/10.1109/tse.2010.93openalex-snapshot
Dynamic Analysis for Diagnosing Integration Faults
inferred← citeshttps://doi.org/10.1145/1368088.1368157openalex-snapshot
Automatic generation of software behavioral models
inferred← citeshttps://doi.org/10.32657/10356/13589openalex-snapshot
Refining learning models in grammatical inference
inferred← citeshttps://doi.org/10.5755/j01.itc.51.4.31394openalex-snapshot
DLIQ: A Deterministic Finite Automaton Learning Algorithm through Inverse Queries
inferred← citeshttps://doi.org/10.5772/17366openalex-snapshot
Application of Streaming Algorithms and DFA Learning for Approximating Solutions to Problems in Robot Navigation
inferred← citeshttps://doi.org/10.70675/2a5fd2c0z8a3az4365zbd82zad0989f7ed60openalex-snapshot
Automated test generation for production systems with a model-based testing approach
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.