MAT Learning of Universal Automata
2013 (English)In: Language and Automata Theory and Applications: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / [ed] Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe, Springer Berlin/Heidelberg, 2013, 141-152 p.Conference paper (Refereed)
A MAT learning algorithm is presented that infers the universal automaton (UA) for a regular target language, using a polynomial number of queries with respect to that automaton. The UA is one of several canonical characterizations for regular languages. Our learner is based on the concept of an observation table, which seems to be particularly fitting for this computational model, and the necessary notions and definitions are adapted from the literature to the case of UA.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 141-152 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 7810
MAT learning, Universal automata, active learning
Computer and Information Science
Research subject Computing Science
IdentifiersURN: urn:nbn:se:umu:diva-80729DOI: 10.1007/978-3-642-37064-9_14ISBN: 978-3-642-37063-2ISBN: 978-3-642-37064-9OAI: oai:DiVA.org:umu-80729DiVA: diva2:651272
7th International Conference on Language and Automata Theory and Applications, LATA 2013, 2 April 2013 through 5 April 2013, Bilbao
FunderSwedish Research CouncilVinnova