Learning unary output two-tape automata from multiplicity and equivalence queries

DOI10.1007/3-540-49730-7_7MaRDI QIDQ4247004zbMATH OpenFDO

Authors Stefano Varricchio, Giovanna Melideo

Publication date 13 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49730-7_7

zbMATH Keywords

learning problemnondeterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning two-tape automata from queries and counterexamples
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning unary automata
• Complexity of equivalence and learning for multiplicity tree automata

Cited in

(5)

• Stefano Varricchio (1960-2008)
• Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
• Learning finite automata using label queries
• Learning two-tape automata from queries and counterexamples
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries

This page was built for publication: Learning unary output two-tape automata from multiplicity and equivalence queries

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