Weighted automata are compact and actively learnable

DOI10.1016/j.ipl.2021.106133OpenAlexW3159538583MaRDI QIDQ2032169

Prakash Panangaden, Artem Kaznatcheev

Publication date: 16 June 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.10498

zbMATH Keywords

formal languagesactive learningweighted automatanondeterministic finite automatalearnability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Representing regular languages of infinite words using mod 2 multiplicity automata

Cites Work

• Unnamed Item
• Handbook of weighted automata
• Learning regular sets from queries and counterexamples
• Matrices de Hankel
• Learning regular languages using RFSAs.
• When won't membership queries help?
• Realizations by stochastic finite automata
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
• Cryptographic limitations on learning Boolean formulae and finite automata
• Weighted Automata Algorithms
• Computational Complexity
• Algebra-coalgebra duality in brzozowski's minimization algorithm

This page was built for publication: Weighted automata are compact and actively learnable