Weighted automata are compact and actively learnable

DOI10.1016/J.IPL.2021.106133OpenAlexW3159538583MaRDI QIDQ2032169FDOQ2032169

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 languagesweighted automataactive learningnondeterministic finite automatalearnability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (3)

• Representing regular languages of infinite words using mod 2 multiplicity automata
• Finitely ambiguous and finitely sequential weighted automata over fields
• Generalization bounds for learning weighted automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032169)