Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries

DOI10.1007/978-3-540-88009-7_12zbMath1177.68121OpenAlexW1510395033MaRDI QIDQ3528415

Jose Oncina

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_12

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

MAT learners for tree series: an abstract data type and two realizations

Cites Work

• Matrices de Hankel
• Queries and concept learning
• Realizations by stochastic finite automata
• Learning functions represented as multiplicity automata

This page was built for publication: Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries