Change search
ReferencesLink to record
Permanent link

Direct link
Polynomial inference of universal automata from membership and equivalence queries
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2016 (English)In: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 246, 3-19 p.Article in journal (Refereed) PublishedText
Abstract [en]

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.
Keyword [en]
Query learning, Universal finite automata, Observation tables
National Category
Computer and Information Science
URN: urn:nbn:se:umu:diva-116070DOI: 10.1016/j.ic.2015.11.005ISI: 000368042500002OAI: diva2:902263
7th International Conference on Language and Automata Theory and Applications (LATA), APR 02-05, 2013, Bilbao, SPAIN
Available from: 2016-02-10 Created: 2016-02-08 Last updated: 2016-02-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Bjorklund, Johanna
By organisation
Department of Computing Science
In the same journal
Information and Computation
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 40 hits
ReferencesLink to record
Permanent link

Direct link