Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Dana Angluin"'
Publikováno v:
Transactions of the Association for Computational Linguistics, Vol 12 (2024)
Externí odkaz:
https://doaj.org/article/9f4817c19b754188ab26020ed955d5a4
Publikováno v:
Transactions of the Association for Computational Linguistics, Vol 10 (2022)
Externí odkaz:
https://doaj.org/article/2d6e3a021ef24a47b04cab72661d6411
Autor:
Dana Angluin, Dana Fisman
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 265-279 (2018)
A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The
Externí odkaz:
https://doaj.org/article/70d51d121d23461088bf9505ba37493a
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 3 (2019)
We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\ome
Externí odkaz:
https://doaj.org/article/c9d8bbbeb18344a3b982b43595ca190f
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to th
Externí odkaz:
https://doaj.org/article/4a0c4736a6aa4775814223e4d5fc47a1
Autor:
Tyler Dohrn, Dana Angluin
Publikováno v:
Theoretical Computer Science. 808:2-13
Learning a target concept from a finite n × m concept space requires Ω ( n ) proper equivalence queries in the worst case. We propose a variation of the usual equivalence query in which the teacher is constrained to choose counterexamples randomly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56c4bcba4dc952350598a6a588738c39
https://doi.org/10.1016/j.tcs.2019.11.009
https://doi.org/10.1016/j.tcs.2019.11.009
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030992521
We explore the suitability of mod 2 multiplicity automata (M2MAs) as a representation for regular languages of infinite words. M2MAs are a deterministic representation that is known to be learnable in polynomial time with membership and equivalence q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8de3fa848a7f9a0eb8c3027f798bf030
https://doi.org/10.1007/978-3-030-99253-8_1
https://doi.org/10.1007/978-3-030-99253-8_1
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030452360
TACAS (2)
TACAS (2)
We study identification in the limit using polynomial time and data for models of $$\omega $$-automata. On the negative side we show that non-deterministic $$\omega $$-automata (of types Büchi, coBüchi, Parity or Muller) can not be polynomially lea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7dc49a6cbab31ade27b01f435322c503
https://doi.org/10.1007/978-3-030-45237-7_20
https://doi.org/10.1007/978-3-030-45237-7_20
Autor:
Leonor Becerra-Bonache, Dana Angluin
Publikováno v:
Artificial Intelligence. 242:23-51
We present a computational model that takes into account semantics for language learning and allows us to model meaning-preserving corrections. The model is constructed with a learner and a teacher who interact in a sequence of shared situations by p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc2193c26918624d70519fac1683a518
https://doi.org/10.1016/j.artint.2016.10.002
https://doi.org/10.1016/j.artint.2016.10.002
Autor:
Dana Fisman, Dana Angluin
Publikováno v:
Information and Computation. 278:104598
A regular language is almost fully characterized by its right congruence relation. The same does not hold for regular ω-languages. The right congruence of a regular ω-language may not be informative enough; many regular ω-languages have a trivial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63c85187db76563c13ea12467357c8b5
https://doi.org/10.1016/j.ic.2020.104598
https://doi.org/10.1016/j.ic.2020.104598