scientific article; zbMATH DE number 7561484
From MaRDI portal
Publication:5091140
DOI10.4230/LIPIcs.ICDT.2019.24MaRDI QIDQ5091140
Martin Ritzert, Emilie Grienenberger
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1909.10994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Machine learning: from theory to applications. Cooperative research at Siemens and MIT
- Learnability and definability in trees and similar structures
- Factorization forests of finite height
- Learning regular sets from queries and counterexamples
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Green’s Relations and Their Use in Automata Theory
- Weak Second‐Order Arithmetic and Finite Automata
- Fast Algorithms for Finding Nearest Common Ancestors
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Complexity of automaton identification from given data
- On the complexity of minimum inference of regular sets
- Cryptographic limitations on learning Boolean formulae and finite automata
- Inductive Logic Programming: Theory and methods
- Learning Join Queries from User Examples
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Inductive logic programming
This page was built for publication:
