VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states

DOI10.1016/S0166-218X(96)00050-9zbMath0874.68217OpenAlexW4239246705MaRDI QIDQ1356504

Sei'ichi Tani, Yoshiyasu Ishigami

Publication date: 10 November 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

finite automataVC-dimensions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On the Rademacher Complexity of Weighted Automata

Cites Work

• Learning commutative deterministic finite state automata in polynomial time
• Learning regular sets from queries and counterexamples
• A maxmin problem on finite automata
• Lower bound methods and separation results for on-line learning models
• Nonuniform learnability
• Queries and concept learning
• Learnability and the Vapnik-Chervonenkis dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states