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