On the public citation graph

Incremental regular inference

https://doi.org/10.1007/bfb0033357
0 signed · 77 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-58473-0_134openalex-snapshot
What is the search space of the regular inference?
inferredcites →https://doi.org/10.1007/3-540-58473-0_140openalex-snapshot
Application of OSTIA to machine translation tasks
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.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
inferredcites →https://doi.org/10.1145/130385.130390openalex-snapshot
Random DFA's can be approximately learned from sparse uniform examples
inferredcites →https://doi.org/10.1145/322326.322334openalex-snapshot
Inference of Reversible Languages

What points at this work

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

inferred← citeshttps://doi.org/10.1002/smr.373openalex-snapshot
Improving dynamic software analysis by applying grammar inference principles
inferred← citeshttps://doi.org/10.1007/11693017_10openalex-snapshot
Regular Inference for State Machines with Parameters
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_9openalex-snapshot
Identification of Function Distinguishable Languages
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_39openalex-snapshot
Learning DFA from simple examples
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_18openalex-snapshot
Learning Moore Machines from Input-Output Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-30482-1_26openalex-snapshot
Learning to Verify Safety Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-78743-3_24openalex-snapshot
Regular Inference for State Machines Using Domains with Equality Tests
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_11openalex-snapshot
State-Merging DFA Induction Algorithms with Mandatory Merge Constraints
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-21455-4_10openalex-snapshot
Learning of Automata Models Extended with Data
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-642-35795-4_5openalex-snapshot
Software Testing is Necessary But Not Sufficient for Software Trustworthiness
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.1007/s00607-012-0214-zopenalex-snapshot
Detecting component changes at run time with behavior models
inferred← citeshttps://doi.org/10.1007/s10009-019-00544-0openalex-snapshot
Learning Moore machines from input–output traces
inferred← citeshttps://doi.org/10.1007/s10009-022-00651-5openalex-snapshot
Learning of behavioural models and dependency graphs for communicating systems with CkTailv2
inferred← citeshttps://doi.org/10.1007/s11219-019-09485-yopenalex-snapshot
Model generation of component-based systems
inferred← citeshttps://doi.org/10.1016/b978-0-323-90240-3.00005-9openalex-snapshot
Test scenario generator learning for model-based testing of mobile robots
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.044openalex-snapshot
Regular Model Checking Using Inference of Regular Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.008openalex-snapshot
Algorithms for learning regular expressions from positive data
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.04.002openalex-snapshot
Learning finite cover automata from queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00075-0openalex-snapshot
Identification of function distinguishable languages
inferred← citeshttps://doi.org/10.1023/a:1010822518073openalex-snapshot
Learning DFA from Simple Examples
inferred← citeshttps://doi.org/10.1080/08839510701853200openalex-snapshot
THE QSM ALGORITHM AND ITS APPLICATION TO SOFTWARE BEHAVIOR MODEL INDUCTION
inferred← citeshttps://doi.org/10.1080/09540090110072327openalex-snapshot
Connectionist learning of regular graph grammars
inferred← citeshttps://doi.org/10.1109/access.2023.3242124openalex-snapshot
A Reinforcement Learning Based Grammatical Inference Algorithm Using Block-Based Delta Inverse Strategy
inferred← citeshttps://doi.org/10.1109/cec.2006.1688331openalex-snapshot
An Incremental-Evolutionary Approach for Learning Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1109/cig.2018.8490435openalex-snapshot
Regular Language Inference for Learning Rules of Simplified Boardgames
inferred← citeshttps://doi.org/10.1109/fuzzy.2006.1681964openalex-snapshot
Alignment Based Similarity Measure for Grammar Learning
inferred← citeshttps://doi.org/10.1109/icassp.2000.861814openalex-snapshot
Automatic learning of numeral grammars for multi-lingual speech synthesizers
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00180openalex-snapshot
Retro-engineering state machines into PDDL domains
inferred← citeshttps://doi.org/10.1109/ictai56018.2022.00113openalex-snapshot
An Accurate PDDL Domain Learning Algorithm from Partial and Noisy Observations
inferred← citeshttps://doi.org/10.1109/iecon.2012.6389399openalex-snapshot
From requirements to software trustworthiness using scenarios and finite state machine
inferred← citeshttps://doi.org/10.1109/informatics.2015.7377823openalex-snapshot
Automated abstraction of language concepts
inferred← citeshttps://doi.org/10.1109/issre.2012.14openalex-snapshot
Revolution: Automatic Evolution of Mined Specifications
inferred← citeshttps://doi.org/10.1109/ladc.2013.22openalex-snapshot
An Automated Approach to Generate Web Applications Attack Scenarios
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.2005.138openalex-snapshot
Generating annotated behavior models from end-user scenarios
inferred← citeshttps://doi.org/10.1109/tse.2009.89openalex-snapshot
Learning Communicating Automata from MSCs
inferred← citeshttps://doi.org/10.1145/1138912.1138919openalex-snapshot
Inferring state-based behavior models
inferred← citeshttps://doi.org/10.1145/1871840.1871848openalex-snapshot
Clustering based approach to learning regular expressions over large alphabet for noisy unstructured text
inferred← citeshttps://doi.org/10.1145/2983990.2984030openalex-snapshot
FIDEX: filtering spreadsheet data using examples
inferred← citeshttps://doi.org/10.1145/3461002.3473066openalex-snapshot
LIFTS
inferred← citeshttps://doi.org/10.1162/coli_a_00401openalex-snapshot
Approximating Probabilistic Models as Weighted Finite Automata
inferred← citeshttps://doi.org/10.1186/1678-4804-20-4openalex-snapshot
An automated black box approach for web vulnerability identification and attack scenario generation
inferred← citeshttps://doi.org/10.2197/ipsjtrans.3.163openalex-snapshot
State and Threshold Sequence Minimization Algorithm of Linear Separation Automata
inferred← citeshttps://doi.org/10.2197/ipsjtrans.3.62openalex-snapshot
Theory of Minimizing Linear Separation Automata
inferred← citeshttps://doi.org/10.25100/iyc.v11i1.2468openalex-snapshot
Comparación de dos algoritmos recientes para inferencia gramatical de lenguajes regulares mediante autómatas no deterministas
inferred← citeshttps://doi.org/10.26438/ijcse/v6i1.108113openalex-snapshot
Approaches for Efficient Learning Software Models A Survey
inferred← citeshttps://doi.org/10.3115/1613715.1613719openalex-snapshot
Regular expression learning for information extraction
inferred← citeshttps://doi.org/10.31274/rtd-180813-4981openalex-snapshot
Constructive learning: inducing grammars and neural networks
inferred← citeshttps://doi.org/10.3390/electronics9010097openalex-snapshot
Applications in Security and Evasions in Machine Learning: A Survey
inferred← citeshttps://doi.org/10.4018/978-1-60566-330-2.ch001openalex-snapshot
Extending XML Types Using Updates
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.1909.01421openalex-snapshot
Mining Insights from Weakly-Structured Event Data
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.5755/j01.itc.51.4.31394openalex-snapshot
DLIQ: A Deterministic Finite Automaton Learning Algorithm through Inverse Queries
inferred← citeshttps://doi.org/10.70675/2a5fd2c0z8a3az4365zbd82zad0989f7ed60openalex-snapshot
Automated test generation for production systems with a model-based testing approach
inferred← citeshttps://doi.org/10.7287/peerj-cs.436v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Extracting automata from neural networks using active learning (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.436v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Extracting automata from neural networks using active learning (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.436v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Extracting automata from neural networks using active learning (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.436openalex-snapshot
Extracting automata from neural networks using active learning
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.