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

DOI10.1016/S0166-218X(96)00025-XzbMath0870.68101MaRDI QIDQ5967074

Sei'ichi Tani, Yoshiyasu Ishigami

Publication date: 9 June 1997

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

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

zbMATH Keywords

Vapnik-Chervonenkis dimensions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Efficiency in the Identification in the Limit Learning Paradigm ⋮ Generalization bounds for learning weighted automata ⋮ Shapley Homology: Topological Analysis of Sample Influence for Neural Networks ⋮ VC-dimensions of nondeterministic finite automata for words of equal length

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Queries and concept learning
• Learnability and the Vapnik-Chervonenkis dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

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