Active learning for deterministic bottom-up nominal tree automata
From MaRDI portal
Publication:6109488
DOI10.1007/978-3-031-17715-6_22arXiv2208.08319OpenAlexW4312268188MaRDI QIDQ6109488
Yoshiaki Takata, Hiroyuki Seki, Rindo Nakanishi
Publication date: 28 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.08319
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to abstract syntax with variable binding
- Active learning for extended finite state machines
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- Finite-memory automata
- Context-free languages over infinite alphabets
- Intractability of decision problems for finite-memory automata
- Complexity results on register context-free grammars and register tree automata
- Reactive synthesis from visibly register pushdown automata
- Regular expressions for data words
- Reachability in pushdown register automata
- Automata theory in nominal sets
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Learning Meets Verification
- Finite state machines for strings over infinite alphabets
- A Fresh Approach to Learning Register Automata
- Learning nominal automata
- Tree Automata over Infinite Alphabets
- Active learning for deterministic bottom-up nominal tree automata
This page was built for publication: Active learning for deterministic bottom-up nominal tree automata
