Name
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 definitions are adapted from the literature to the case of UA. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ic.2015.11.005 | Information and Computation |
Keywords | Field | DocType |
Query learning,Universal finite automata,Observation tables | Discrete mathematics,Two-way deterministic finite automaton,Deterministic automaton,Nondeterministic finite automaton,Polynomial,Algebra,Theoretical computer science,Regular language,Mathematics,Probabilistic automaton,Büchi automaton,ω-automaton | Journal |
Volume | Issue | ISSN |
246 | C | 0890-5401 |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johanna Björklund | 1 | 5 | 6.23 |
| Henning Fernau | 2 | 1646 | 162.68 |
| Anna Kasprzik | 3 | 31 | 5.08 |