Polynomial inference of universal automata from membership and equivalence queries
2016 (English)In: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 246, 3-19 p.Article in journal (Refereed) PublishedText
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 definitions are adapted from the literature to the case of UA.
Place, publisher, year, edition, pages
2016. Vol. 246, 3-19 p.
Query learning, Universal finite automata, Observation tables
Computer and Information Science
IdentifiersURN: urn:nbn:se:umu:diva-116070DOI: 10.1016/j.ic.2015.11.005ISI: 000368042500002OAI: oai:DiVA.org:umu-116070DiVA: diva2:902263
7th International Conference on Language and Automata Theory and Applications (LATA), APR 02-05, 2013, Bilbao, SPAIN