Efficient learning of real time two-counter automata

DOI10.1007/3-540-61863-5_39zbMATH Open1184.68282OpenAlexW4242944638MaRDI QIDQ3556985FDOQ3556985

Authors: Amr F. Fahmy, Robert S. Roos 

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1007/3-540-61863-5_39

Recommendations

• Learning two-tape automata from queries and counterexamples
• Efficient learning of typical finite automata from random walks
• Learning deterministic finite automata from smallest counterexamples
• A generic algorithm for learning symbolic automata from membership queries
• scientific article; zbMATH DE number 1303603

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cited In (2)

• Efficient learning of real time one-counter automata
• Learning realtime one-counter automata

This page was built for publication: Efficient learning of real time two-counter automata

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