On the public citation graph
Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm
0 signed · 280 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-58473-0_134openalex-snapshot
What is the search space of the regular inference?
inferredcites →https://doi.org/10.1007/bfb0033365openalex-snapshot
Identification of DFA: Data-dependent versus data-independent algorithms
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/tc.1978.1675053openalex-snapshot
Inference of Sequential Machines from Sample Computations
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/167088.167191openalex-snapshot
Efficient learning of typical finite automata from random walks
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/73007.73049openalex-snapshot
Crytographic limitations on learning Boolean formulae and finite automata
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/11564096_50openalex-snapshot
A Similar Fragments Merging Approach to Learn Automata on Proteins
inferred← citeshttps://doi.org/10.1007/11575832_15openalex-snapshot
Classifying Sentences Using Induced Structure
inferred← citeshttps://doi.org/10.1007/11872436_18openalex-snapshot
The Tenjinno Machine Translation Competition
inferred← citeshttps://doi.org/10.1007/11872436_3openalex-snapshot
Identification in the Limit of Systematic-Noisy Languages
inferred← citeshttps://doi.org/10.1007/3-540-33486-6_7openalex-snapshot
Computational Grammatical Inference
inferred← citeshttps://doi.org/10.1007/3-540-36384-x_3openalex-snapshot
Behavior-Based Model Construction
inferred← citeshttps://doi.org/10.1007/3-540-39945-3_5openalex-snapshot
Using Finite Automata to Mine Execution Data for Intrusion Detection: A Preliminary Report
inferred← citeshttps://doi.org/10.1007/3-540-44522-6_3openalex-snapshot
Current Trends in Grammatical Inference
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_26openalex-snapshot
Learning Regular Languages Using RFSA
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_27openalex-snapshot
Inference of ω-Languages from Prefixes
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_11openalex-snapshot
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_12openalex-snapshot
Stochastic Grammatical Inference with Multinomial Tests
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_13openalex-snapshot
Learning Languages with Help
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_22openalex-snapshot
Shallow Parsing Using Probabilistic Grammatical Inference
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_3openalex-snapshot
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_7openalex-snapshot
Learning Probabilistic Residual Finite State Automata
inferred← citeshttps://doi.org/10.1007/978-0-387-74935-8_36openalex-snapshot
Automatic Construction of FSA Language Model for Speech Recognition by FSA DP-Matching
inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_115-1openalex-snapshot
Grammatical Inference
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-030-02450-5_22openalex-snapshot
Formalising Extended Finite State Machine Transition Merging
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_12openalex-snapshot
Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference
inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_23openalex-snapshot
Benchmarks for Automata Learning and Conformance Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-30446-1_14openalex-snapshot
Incorporating Data into EFSM Inference
inferred← citeshttps://doi.org/10.1007/978-3-031-04673-5_3openalex-snapshot
Reverse-Engineering EFSMs with Data Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-031-15008-1_15openalex-snapshot
A Multi-level Methodology for Behavioral Comparison of Software-Intensive Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-19992-9_2openalex-snapshot
Dynamic Shielding for Reinforcement Learning in Black-Box Environments
inferred← citeshttps://doi.org/10.1007/978-3-031-22216-0_5openalex-snapshot
Evaluation of Safe Reinforcement Learning with CoMirror Algorithm in a Non-Markovian Reward Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-55630-2_5openalex-snapshot
Learning Automata-Based Complex Event Patterns in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_4openalex-snapshot
PDFA Distillation with Error Bound Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-031-71177-0_4openalex-snapshot
DFAMiner: Mining Minimal Separating DFAs from Labelled Samples
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_6openalex-snapshot
Extending AALpy with Passive Learning: A Generalized State-Merging Approach
inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_9openalex-snapshot
Unsupervised Automata Learning via Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-15700-3_9openalex-snapshot
SAT-Based Synthesis of Minimal Deterministic Real-Time Automata via 3DRTA Representation
inferred← citeshttps://doi.org/10.1007/978-3-032-28079-4_8openalex-snapshot
Learning Probabilistic Automata from Single Continuous-Valued System Logs
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_18openalex-snapshot
Passive Learning of Symbolic Automata over Monotonic Algebras
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_25openalex-snapshot
The Simulator’s Blueprint: Automata Learning from Cybersecurity Logs
inferred← citeshttps://doi.org/10.1007/978-3-319-08434-3_21openalex-snapshot
Mining State-Based Models from Proof Corpora
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_48openalex-snapshot
BFS-Based Symmetry Breaking Predicates for DFA Identification
inferred← citeshttps://doi.org/10.1007/978-3-319-16501-1openalex-snapshot
Genetic programming : 18th European conference, EuroGP 2015, Copenhagen, Denmark, April 8-10, 2015, proceedings
inferred← citeshttps://doi.org/10.1007/978-3-319-16501-1_2openalex-snapshot
Learning Text Patterns Using Separate-and-Conquer Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_16openalex-snapshot
SEPIA: Search for Proofs Using Inferred Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-27998-5_9openalex-snapshot
Software Behavior Model Measuring Approach of Combining Structural Analysis and Language Set
inferred← citeshttps://doi.org/10.1007/978-3-319-32149-3_24openalex-snapshot
Parallel Induction of Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-46801-3_8openalex-snapshot
Applications of GI Methods in Selected Fields
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-319-49130-1_22openalex-snapshot
Structural Knowledge Extraction from Mobility Data
inferred← citeshttps://doi.org/10.1007/978-3-319-68972-2_14openalex-snapshot
Automatic Transition System Model Identification for Network Applications from Packet Traces
inferred← citeshttps://doi.org/10.1007/978-3-319-74781-1_9openalex-snapshot
Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-96562-8_1openalex-snapshot
Machine Learning for Software Analysis: Models, Methods, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-96562-8_2openalex-snapshot
Learning-Based Testing: Recent Progress and Future Prospects
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_13openalex-snapshot
Representing Languages by Learnable Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_3openalex-snapshot
The Omphalos Context-Free Grammar Learning Competition
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_4openalex-snapshot
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_9openalex-snapshot
Learning Node Selecting Tree Transducer from Completely Annotated Examples
inferred← citeshttps://doi.org/10.1007/978-3-540-39857-8_8openalex-snapshot
Unambiguous Automata Inference by Means of State-Merging Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_12openalex-snapshot
Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_3openalex-snapshot
Efficient Ambiguity Detection in C-NFA
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_4openalex-snapshot
Learning Regular Languages Using Non Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_5openalex-snapshot
Smoothing Probabilistic Automata: An Error-Correcting Approach
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-540-73001-9_2openalex-snapshot
Learning as Data Compression
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-540-88009-7_19openalex-snapshot
Polynomial Distinguishability of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_20openalex-snapshot
Evaluation and Comparison of Inferred Regular Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_6openalex-snapshot
Learning Commutative Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_20openalex-snapshot
Iterative Refinement of Reverse-Engineered Models by Model-Based Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-14684-8_1openalex-snapshot
Learning Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_1openalex-snapshot
Grammatical Inference and Games: Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_17openalex-snapshot
A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_22openalex-snapshot
Grammatical Inference Algorithms in MATLAB
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_7openalex-snapshot
Exact DFA Identification Using SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-15585-7_16openalex-snapshot
The Practical Assessment of Test Sets with Inductive Inference Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-16573-3_10openalex-snapshot
Increasing Functional Coverage by Inductive Testing: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-17071-3_14openalex-snapshot
Incrementally Discovering Testable Specifications from Program Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-24580-0_15openalex-snapshot
Assessing Test Adequacy for Black-Box Systems without Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-34106-9_10openalex-snapshot
Regular Inference as Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-34691-0_14openalex-snapshot
Using Behaviour Inference to Optimise Regression Test Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-36089-3_12openalex-snapshot
Grammatical Inference in Software Engineering: An Overview of the State of the Art
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_18openalex-snapshot
Automatic Inference of Erlang Module Behaviour
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.1007/978-3-662-48395-4_8openalex-snapshot
Learning the Language of Biological Sequences
inferred← citeshttps://doi.org/10.1007/978-90-481-3517-2_28openalex-snapshot
Speech Recognizer with Dynamic Alternative Path Search and Its Performance Evaluation
inferred← citeshttps://doi.org/10.1007/978-981-95-7826-9_10openalex-snapshot
Efficient Decomposition Identification of Deterministic Finite Automata from Examples
inferred← citeshttps://doi.org/10.1007/bfb0054070openalex-snapshot
A stochastic search approach to grammar induction
inferred← citeshttps://doi.org/10.1007/bfb0054076openalex-snapshot
How considering incompatible state mergings may reduce the DFA induction search tree
inferred← citeshttps://doi.org/10.1007/s00236-020-00365-8openalex-snapshot
Minimal consistent DFA from sample strings
inferred← citeshttps://doi.org/10.1007/s10009-004-0139-8openalex-snapshot
Behavior-based model construction
inferred← citeshttps://doi.org/10.1007/s10009-016-0442-1openalex-snapshot
Exact finite-state machine identification from scenarios and temporal properties
inferred← citeshttps://doi.org/10.1007/s10009-019-00544-0openalex-snapshot
Learning Moore machines from input–output traces
inferred← citeshttps://doi.org/10.1007/s10270-020-00789-3openalex-snapshot
An interdisciplinary comparison of sequence modeling methods for next-element prediction
inferred← citeshttps://doi.org/10.1007/s10489-025-07066-0openalex-snapshot
Using transformers to learn system models
inferred← citeshttps://doi.org/10.1007/s10664-012-9210-3openalex-snapshot
STAMINA: a competition to encourage the development and assessment of software model inference techniques
inferred← citeshttps://doi.org/10.1007/s10664-012-9222-zopenalex-snapshot
Software model synthesis using satisfiability solvers
inferred← citeshttps://doi.org/10.1007/s10664-015-9367-7openalex-snapshot
Inferring extended finite state machine models from software executions
inferred← citeshttps://doi.org/10.1007/s10664-020-09912-wopenalex-snapshot
Learning by sampling: learning behavioral family models from software product lines
inferred← citeshttps://doi.org/10.1007/s10664-021-10111-4openalex-snapshot
PRINS: scalable model inference for component-based system logs
inferred← citeshttps://doi.org/10.1007/s10703-023-00433-yopenalex-snapshot
Enhancing active model learning with equivalence checking using simulation relations
inferred← citeshttps://doi.org/10.1007/s10844-008-0063-6openalex-snapshot
A note on phase transitions and computational pitfalls of learning from sequences
inferred← citeshttps://doi.org/10.1007/s10994-006-9593-8openalex-snapshot
LARS: A learning algorithm for rewriting systems
inferred← citeshttps://doi.org/10.1007/s10994-006-9613-8openalex-snapshot
Interactive learning of node selecting tree transducer
inferred← citeshttps://doi.org/10.1007/s10994-011-5265-4openalex-snapshot
Efficiently identifying deterministic real-time automata from labeled data
inferred← citeshttps://doi.org/10.1007/s10994-013-5409-9openalex-snapshot
PAutomaC: a probabilistic automata and hidden Markov models learning competition
inferred← citeshttps://doi.org/10.1007/s10994-013-5419-7openalex-snapshot
Learning register automata: from languages to program structures
inferred← citeshttps://doi.org/10.1007/s11219-017-9399-xopenalex-snapshot
Model extraction and test generation from JUnit test suites
inferred← citeshttps://doi.org/10.1016/b978-0-12-408089-8.00001-xopenalex-snapshot
Reverse-Engineering Software Behavior
inferred← citeshttps://doi.org/10.1016/b978-0-444-53726-3.00016-5openalex-snapshot
Computational Language Learning (Update of )
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.09.016openalex-snapshot
Learning DFA representations of HTTP for protecting web applications
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.12.547openalex-snapshot
Trustiness Evaluation Model Based on Software Behavior
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.089openalex-snapshot
A Technique for Verifying Component-Based Software
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.023openalex-snapshot
The efficiency of identifying timed automata and the power of clocks
inferred← citeshttps://doi.org/10.1016/j.infsof.2007.08.003openalex-snapshot
MARS: A metamodel recovery system using grammar inference
inferred← citeshttps://doi.org/10.1016/j.infsof.2014.12.004openalex-snapshot
The CARE platform for the analysis of behavior model inference techniques
inferred← citeshttps://doi.org/10.1016/j.infsof.2019.05.002openalex-snapshot
Interactive semi-automated specification mining for debugging: An experience report
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.04.002openalex-snapshot
Learning finite cover automata from queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.027openalex-snapshot
A multi-parameter analysis of hard problems on deterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.knosys.2017.02.001openalex-snapshot
Extraction and optimization of classification rules for temporal sequences: Application to hospital data
inferred← citeshttps://doi.org/10.1016/j.patcog.2004.03.023openalex-snapshot
Natural language grammar induction with a generative constituent-context model
inferred← citeshttps://doi.org/10.1016/j.patcog.2004.03.027openalex-snapshot
Inference of regular languages using state merging algorithms with search
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.01.003openalex-snapshot
A bibliographical study of grammatical inference
inferred← citeshttps://doi.org/10.1016/j.patcog.2024.110326openalex-snapshot
A categorical interpretation of state merging algorithms for DFA inference
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.scico.2014.05.008openalex-snapshot
A survey of grammatical inference in software engineering
inferred← citeshttps://doi.org/10.1016/j.scico.2017.04.004openalex-snapshot
Inferring software behavioral models with MapReduce
inferred← citeshttps://doi.org/10.1016/j.scico.2019.03.003openalex-snapshot
Behavioral model identification and classification of multi-component systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.008openalex-snapshot
Learning regular languages using RFSAs
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.009openalex-snapshot
Inference of ω-languages from prefixes
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.017openalex-snapshot
Universal automata and NFA learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.042openalex-snapshot
Polynomial characteristic sets for DFA identification
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.09.023openalex-snapshot
Regular inference as vertex coloring
inferred← citeshttps://doi.org/10.1017/s1351324911000064openalex-snapshot
A randomised inference algorithm for regular tree languages
inferred← citeshttps://doi.org/10.1023/a:1007653929870openalex-snapshot
Stochastic Grammatical Inference of Text Database Structure
inferred← citeshttps://doi.org/10.1023/a:1010828029885openalex-snapshot
Efficient Algorithms for the Inference of Minimum Size DFAs
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/08839510701853267openalex-snapshot
MODELING WEB NAVIGATION USING GRAMMATICAL INFERENCE
inferred← citeshttps://doi.org/10.1080/08839510802164127openalex-snapshot
AN UNSUPERVISED INCREMENTAL LEARNING ALGORITHM FOR DOMAIN-SPECIFIC LANGUAGE DEVELOPMENT
inferred← citeshttps://doi.org/10.1093/comjnl/bxz056openalex-snapshot
Observation Tree Approach: Active Learning Relying on Testing
inferred← citeshttps://doi.org/10.1101/143024openalex-snapshot
An Experiment in Learning the Language of Sequence Motifs: Sequence Logos vs. Finite-State Machines
inferred← citeshttps://doi.org/10.1109/34.955112openalex-snapshot
Hidden Markov models with patterns to learn Boolean vector sequences and applications to the built-in self-test for integrated circuits
inferred← citeshttps://doi.org/10.1109/43.806807openalex-snapshot
A new algorithm for exact reduction of incompletely specified finite state machines
inferred← citeshttps://doi.org/10.1109/acsac.2000.898854openalex-snapshot
Two state-based approaches to program-based anomaly detection
inferred← citeshttps://doi.org/10.1109/aitest49225.2020.00023openalex-snapshot
Improving Automated GUI Testing by Learning to Avoid Infeasible Tests
inferred← citeshttps://doi.org/10.1109/ase.2008.35openalex-snapshot
Inferring Finite-State Models with Temporal Constraints
inferred← citeshttps://doi.org/10.1109/ast66626.2025.00010openalex-snapshot
Automated Test-Case Generation for REST APIs Using Model Inference Search Heuristic
inferred← citeshttps://doi.org/10.1109/cec.2003.1299597openalex-snapshot
Learning DFA: evolution versus evidence driven state merging
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/compsac.2015.73openalex-snapshot
Detecting Malicious Inputs of Web Application Parameters Using Character Class Sequences
inferred← citeshttps://doi.org/10.1109/compsac54236.2022.00123openalex-snapshot
Synthesis of Java Deserialisation Filters from Examples
inferred← citeshttps://doi.org/10.1109/csci.2016.0239openalex-snapshot
Grammatical Inference System for Finite State Automata - GIFSA
inferred← citeshttps://doi.org/10.1109/dac18072.2020.9218613openalex-snapshot
Learning Concise Models from Long Execution Traces
inferred← citeshttps://doi.org/10.1109/fuzzy.2006.1681964openalex-snapshot
Alignment Based Similarity Measure for Grammar Learning
inferred← citeshttps://doi.org/10.1109/icassp55912.2026.11461556openalex-snapshot
Dynamic Automaton Refinement and Planning for Non-Markovian RL
inferred← citeshttps://doi.org/10.1109/icccas.2007.4348209openalex-snapshot
State Machine Induction with Positive and Negative Training for Thai Character Recognition
inferred← citeshttps://doi.org/10.1109/iccd53106.2021.00082openalex-snapshot
Model Synthesis for Communication Traces of System Designs
inferred← citeshttps://doi.org/10.1109/icdma.2012.125openalex-snapshot
Mining Protocol State Machines by Interactive Grammar Inference
inferred← citeshttps://doi.org/10.1109/icmla.2011.166openalex-snapshot
Extended Finite-State Machine Induction Using SAT-Solver
inferred← citeshttps://doi.org/10.1109/icpc.2019.00020openalex-snapshot
An Empirical Study on Practicality of Specification Mining Algorithms on a Real-World Application
inferred← citeshttps://doi.org/10.1109/icra55743.2025.11128815openalex-snapshot
Learning Task Specifications from Demonstrations as Probabilistic Automata
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1175719openalex-snapshot
An improved genetic algorithm for the inference of finite state machine
inferred← citeshttps://doi.org/10.1109/icsme.2016.74openalex-snapshot
Inferring Computational State Machine Models from Program Executions
inferred← citeshttps://doi.org/10.1109/icsme.2017.71openalex-snapshot
An Experience Report on Applying Passive Learning in a Large-Scale Payment Company
inferred← citeshttps://doi.org/10.1109/icstw.2018.00050openalex-snapshot
SPYH-Method: An Improvement in Testing of Finite-State Machines
inferred← citeshttps://doi.org/10.1109/ictai.2004.86openalex-snapshot
Mining decision rules from deterministic finite automata
inferred← citeshttps://doi.org/10.1109/indin.2014.6945484openalex-snapshot
Online passive learning of timed automata for cyber-physical production systems
inferred← citeshttps://doi.org/10.1109/isit.2007.4557549openalex-snapshot
The Power and Perils of MDL
inferred← citeshttps://doi.org/10.1109/isqed65160.2025.11014455openalex-snapshot
AutoFlows: Inferring Message Flows from System Communication Traces
inferred← citeshttps://doi.org/10.1109/rew.2016.015openalex-snapshot
Requirements Specification-by-Example Using a Multi-objective Evolutionary Algorithm
inferred← citeshttps://doi.org/10.1109/saner.2019.8668007openalex-snapshot
Improving Model Inference in Industry by Combining Active and Passive Learning
inferred← citeshttps://doi.org/10.1109/sehc.2013.6602476openalex-snapshot
Transformation operators for easier engineering of medical process models
inferred← citeshttps://doi.org/10.1109/sp.2009.14openalex-snapshot
Prospex: Protocol Specification Extraction
inferred← citeshttps://doi.org/10.1109/tcad.2024.3362598openalex-snapshot
AutoModel: Automatic Synthesis of Models From Communication Traces of SoC Designs
inferred← citeshttps://doi.org/10.1109/tdsc.2021.3117348openalex-snapshot
Alert-driven Attack Graph Generation using S-PDFA
inferred← citeshttps://doi.org/10.1109/tevc.2006.880329openalex-snapshot
Learning Finite-State Transducers: Evolution Versus Heuristic State Merging
inferred← citeshttps://doi.org/10.1109/tit.2008.2008152openalex-snapshot
Approximation of the Two-Part MDL Code
inferred← citeshttps://doi.org/10.1109/tkde.2016.2515587openalex-snapshot
Inference of Regular Expressions for Text Extraction from Examples
inferred← citeshttps://doi.org/10.1109/tpami.2005.143openalex-snapshot
Learning deterministic finite automata with a smart state labeling evolutionary algorithm
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.2023.3250835openalex-snapshot
Modelling Second-Order Uncertainty in State Machines
inferred← citeshttps://doi.org/10.1109/wcre.2007.45openalex-snapshot
Reverse Engineering State Machines by Interactive Grammar Inference
inferred← citeshttps://doi.org/10.1109/wcre.2009.17openalex-snapshot
Computing the Structural Difference between State-Based Models
inferred← citeshttps://doi.org/10.1109/wcre.2013.6671305openalex-snapshot
Inferring Extended Finite State Machine models from software executions
inferred← citeshttps://doi.org/10.1109/wetice.2018.00051openalex-snapshot
Improving Test Suites Via a Novel Testing with Model Learning Approach
inferred← citeshttps://doi.org/10.1145/1015330.1015336openalex-snapshot
Boosting grammatical inference with confidence oracles
inferred← citeshttps://doi.org/10.1145/1181775.1181800openalex-snapshot
Scenarios, goals, and state machines
inferred← citeshttps://doi.org/10.1145/1274000.1274039openalex-snapshot
A more bio-plausible approach to the evolutionary inference of finite state machines
inferred← citeshttps://doi.org/10.1145/1555301.1555308openalex-snapshot
Grid management support by means of collaborative learning agents
inferred← citeshttps://doi.org/10.1145/1868044.1868045openalex-snapshot
A framework for the competitive evaluation of model inference techniques
inferred← citeshttps://doi.org/10.1145/1868321.1868324openalex-snapshot
Detection of high-level execution patterns in reactive behavior of control programs
inferred← citeshttps://doi.org/10.1145/2430545.2430549openalex-snapshot
Automated Comparison of State-Based Software Models in Terms of Their Language and Structure
inferred← citeshttps://doi.org/10.1145/2509136.2509552openalex-snapshot
Guided GUI testing of android apps with minimal restart and approximate learning
inferred← citeshttps://doi.org/10.1145/2544173.2509552openalex-snapshot
Guided GUI testing of android apps with minimal restart and approximate learning
showing the first 200 of 271 · page through all 271
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.