Abstract
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. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Björklund, J., Fernau, H., & Kasprzik, A. (2013). MAT learning of universal automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 141–152). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
