Zobrazeno 1 - 10
of 3 692
pro vyhledávání: '"Chomsky hierarchy"'
Autor:
Delétang, Grégoire, Ruoss, Anian, Grau-Moya, Jordi, Genewein, Tim, Wenliang, Li Kevin, Catt, Elliot, Cundy, Chris, Hutter, Marcus, Legg, Shane, Veness, Joel, Ortega, Pedro A.
Reliable generalization lies at the heart of safe ML and AI. However, understanding when and how neural networks generalize remains one of the most important unsolved problems in the field. In this work, we conduct an extensive empirical study (20'91
Externí odkaz:
http://arxiv.org/abs/2207.02098
Autor:
Jäger, Gerhard, Rogers, James
Publikováno v:
Philosophical Transactions: Biological Sciences, 2012 Jul . 367(1598), 1956-1970.
Externí odkaz:
https://www.jstor.org/stable/23250426
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. The two main results of the paper are the following. First, we show that
Externí odkaz:
http://arxiv.org/abs/1102.0947
Autor:
Okubo, Fumiya1 fokubo@artsci.kyushu-u.ac.jp, Yokomori, Takashi2 yokomori@waseda.jp
Publikováno v:
Fundamenta Informaticae. 2015, Vol. 138 Issue 1-2, p31-44. 14p.
Autor:
Elder, Murray
Publikováno v:
Proceedings of Groups St Andrews 2005, London Mathematical Society Lecture Note Series (339), eds C. Campbell, M. Quick, E. Robertson, G. Smith
We consider how the languages of $G$-automata compare with other formal language classes. We prove that if the word problem of a group $G$ is accepted by a machine in the class $\mathcal M$ then the language of any $G$-automaton is in the class $\mat
Externí odkaz:
http://arxiv.org/abs/math/0508166
Autor:
Tim Hunter
Publikováno v:
A Companion to Chomsky
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52cf61da1f393df058abd3e5a9e1397c
https://doi.org/10.1002/9781119598732.ch5
https://doi.org/10.1002/9781119598732.ch5
Publikováno v:
PLoS ONE. Apr2015, Vol. 10 Issue 4, p1-16. 16p.
Autor:
Diego Gabriel Krivochen
Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recursive enumeration is carried out by a procedure which strongl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::859a9c2156149dca1900ec80f0de1716
https://ora.ox.ac.uk/objects/uuid:9778cf3b-c73f-46fb-a6ef-428ff9736ef2
https://ora.ox.ac.uk/objects/uuid:9778cf3b-c73f-46fb-a6ef-428ff9736ef2
Publikováno v:
In Theoretical Computer Science 8 June 2012 436:2-22