Complexity of automaton identification from given data

Cited In (only showing first 100 items - show all)

Identification of Petri nets from knowledge of their language
Approximate learning of limit-average automata
Inductive inference of ultimately periodic sequences
Map learning with uninterpreted sensors and effectors
Learning context-free grammars using tabular representations
Efficiently identifying deterministic real-time automata from labeled data
Learning regular languages using RFSAs.
Learning Meets Verification
Using case-based reasoning approach to the support of ill-structured decisions
The efficiency of identifying timed automata and the power of clocks
Automated assumption generation for compositional verification
Minimizing finite automata is computationally hard
On the Computational Complexity of Linear Discrepancy
Learning regular sets from queries and counterexamples
A dichotomy in the complexity of consistent query answering for queries with two atoms
On the minimization of XML schemas and tree automata for unranked trees
Mining probabilistic automata: a statistical view of sequential pattern mining
Complexity results for generating subgraphs
Finding patterns common to a set of strings
Universal automata and NFA learning
Polynomial characteristic sets for \(DFA\) identification
On the hardness of approximating the minimum consistent OBDD problem
Optimal state reductions of automata with partially specified behaviors
Minimal consistent DFA revisited
Graph orientation to maximize the minimum weighted outdegree
Bounded degree graph inference from walks
Inferring a tree from walks
Descriptional and Computational Complexity of Finite Automata
Learning context-free grammars from structural data in polynomial time
Regular inference as vertex coloring
On the complexity of simple arithmetic expressions
Model-based learning of interaction strategies in multi-agent systems
On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
Polynomial inference of universal automata from membership and equivalence queries
On the zero-inequivalence problem for loop programs
Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
Recent advances of grammatical inference
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Improving active Mealy machine learning for protocol conformance testing
Inference of regular languages using state merging algorithms with search
Kernel methods for learning languages
Grammatical inference: An old and new paradigm
Inductive reasoning and Kolmogorov complexity
Limitations of learning in automata-based systems
Descriptional and computational complexity of finite automata -- a survey
Inference of \(\omega\)-languages from prefixes.
The complexity of properly learning simple concept classes
Polynomial identification of \(\omega \)-automata
Learning Stochastic Logical Automaton
Identification of pattern languages from examples and queries
Learning from positive and negative examples: dichotomies and parameterized algorithms
Hitting all maximal independent sets of a bipartite graph
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
Autonomous agents modelling other agents: a comprehensive survey and open problems
Inferring a tree from walks
Inferring regular languages and \(\omega\)-languages
Recognizing generating subgraphs revisited
Efficient learning of typical finite automata from random walks
Towards a general theory of topological maps
Four one-shot learners for regular tree languages and their polynomial characterizability
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
Complexity of barrier coverage with relocatable sensors in the plane
On Testing P Systems
Prediction-preserving reducibility
Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
Tree containment with soft polytomies
Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise
Model identification of unobservable behavior of discrete event systems using Petri nets
Parameterized weighted containment
Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
Inductive inference of context-free languages based on context-free expressions
Joint learning of reward machines and policies in environments with partially known semantics
Recognizing malicious software behaviors with tree automata inference
Constructing deterministic parity automata from positive and negative examples
Exact complexity of problems of incompletely specified automata
PAC learning under helpful distributions
Passive automata learning: DFAs and NFAs
FSM inference from long traces
Concurrent Kleene algebra with observations: from hypotheses to completeness
Certifying DFA bounds for recognition and separation
Title not available (Why is that?)
Learning weighted automata
A sufficient condition to polynomially compute a minimum separating DFA
On simplified NP-complete variants of \textsc{Monotone 3-Sat}
Induction and exploitation of subgoal automata for reinforcement learning
Learning from positive and negative examples: new proof for binary alphabets
On the Inference of Finite State Automata from Positive and Negative Data
Welfare maximization with friends-of-friends network externalities
Circuit lower bounds from learning-theoretic approaches
Learning Tree Languages
A multi-parameter analysis of hard problems on deterministic finite automata
Active learning for sound negotiations
Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization
Learning reward machines: a study in partially observable reinforcement learning
Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise
The power of random counterexamples
Controlling entity integrity with key sets
Minimal consistent DFA from sample strings
Parallel algorithms for minimal nondeterministic finite automata inference
Learning algorithms

This page was built for publication: Complexity of automaton identification from given data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4153610)