A categorical framework for learning generalised tree automata
From MaRDI portal
Publication:2104477
DOI10.1007/978-3-031-10736-8_4OpenAlexW3000488302MaRDI QIDQ2104477
Tobias Kappé, Gerco van Heerdt, Alexandra Silva, Matteo Sammartino, Jurriaan Rot
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2001.05786
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- The equational theory of pomsets
- Series-parallel languages and the bounded-width property
- Categorical set theory: A characterization of the category of sets
- Learning to coordinate
- On well-founded and recursive coalgebras
- Learning weighted automata over principal ideal domains
- Learning automata with side-effects
- Learning pomset automata
- Coalgebra learning via duality
- Learning tree languages from positive examples and membership queries
- System identification via state characterization
- Learning Register Automata with Fresh Value Generation
- Composing monads using coproducts
- Learning I/O Automata
- Free iterative theories: a coalgebraic view
- Automata Learning
- Learning nominal automata
- Automata Learning: A Categorical Perspective
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
This page was built for publication: A categorical framework for learning generalised tree automata
