Pages that link to "Item:Q749224"
From MaRDI portal
The following pages link to Learning commutative deterministic finite state automata in polynomial time (Q749224):
Displaying 6 items.
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q1356504) (← links)
- On polynomial-time learnability in the limit of strictly deterministic automata (Q1900980) (← links)
- Fundamental results for learning deterministic extended finite state machines from queries (Q1998871) (← links)
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance (Q2465033) (← links)
- Learning deterministic finite automata from smallest counterexamples (Q2706180) (← links)
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q5967074) (← links)