Inferring Symbolic Automata
From MaRDI portal
Publication:6135753
DOI10.46298/lmcs-19(2:5)2023arXiv2112.14252OpenAlexW3098573930MaRDI QIDQ6135753
Dana Fisman, Sandra Zilles, Hadar Frenkel
Publication date: 26 August 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.14252
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning unions of high-dimensional boxes over the reals
- Learning regular omega languages
- Learning of event-recording automata
- Learning context-free grammars from structural data in polynomial time
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Teaching a smarter learner.
- Learning regular sets from queries and counterexamples
- Learning boxes in high dimension
- Event-clock automata: a determinizable class of timed automata
- Characteristic sets for polynomial grammatical inference
- Inferring regular languages and \(\omega\)-languages
- On the learnability of infinitary regular sets
- Queries and concept learning
- Abstract Symbolic Automata
- Symbolic Solving of Extended Regular Expression Inequalities.
- An Evaluation of Automata Algorithms for String Analysis
- Automata Learning with Automated Alphabet Abstraction Refinement
- Linear Automaton Transformations
- Learning Symbolic Automata
- Variable Automata over Infinite Alphabets
- Learning I/O Automata
- Graph-Based Algorithms for Boolean Function Manipulation
- Complexity of automaton identification from given data
- Exact Learning of Discretized Geometric Concepts
- Minimization of Symbolic Tree Automata
- A note on the number of queries needed to identify regular languages
- Assume, Guarantee or Repair
- Learning the Language of Software Errors
- A Generic Algorithm for Learning Symbolic Automata from Membership Queries
- Fundamental Approaches to Software Engineering
- Minimization of symbolic automata
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning of Structurally Unambiguous Probabilistic Grammars
- Query learning of bounded-width OBDDs
- The learnability of symbolic automata
This page was built for publication: Inferring Symbolic Automata
