Zobrazeno 1 - 10
of 551
pro vyhledávání: '"Regular tree grammar"'
Autor:
David M. Cerna, Temur Kutsia
Publikováno v:
ACM Transactions on Computational Logic. 21:1-32
In this article, we address two problems related to idempotent anti-unification. First, we show that there exists an anti-unification problem with a single idempotent symbol that has an infinite minimal complete set of generalizations. It means that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::959873a4cbac64e512013c4d2e7b5c81
https://doi.org/10.1145/3359060
https://doi.org/10.1145/3359060
Autor:
Yuya Maeda, Naoki Nishida
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 289, Iss Proc. WPTE 2018, Pp 68-87 (2019)
The grammar representation of a narrowing tree for a syntactically deterministic conditional term rewriting system and a pair of terms is a regular tree grammar that generates expressions for substitutions obtained by all possible innermost-narrowing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7fc602835c0017b62a12e89d9c7a6e96
https://doaj.org/article/4e533d7e6e6e446a8c95170786313e8b
https://doaj.org/article/4e533d7e6e6e446a8c95170786313e8b
Publikováno v:
International Journal of Advances in Engineering Sciences and Applied Mathematics. 11:2-10
We study the edit-distance of regular tree languages. The edit-distance is a useful metric for measuring the similarity or dissimilarity between two objects. A regular tree language is a set of trees accepted by a finite-state tree automaton or descr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad41b0a2f7a27f3b84bde0dcf3a2b8ff
https://doi.org/10.1007/s12572-018-0221-1
https://doi.org/10.1007/s12572-018-0221-1
Autor:
Sebastian Eberhard, Stefan Hetzl
Publikováno v:
Information and Computation. 259:191-213
We consider the minimal number of productions needed for a grammar to cover a finite language L as the grammatical complexity of L. We study this measure for several types of word and tree grammars and show that it is closely connected to well-known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4865316ef4c5adb16b567c2cebbb3fa0
https://doi.org/10.1016/j.ic.2017.09.001
https://doi.org/10.1016/j.ic.2017.09.001
Akademický článek
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.
Autor:
Maryam Ghorani
Publikováno v:
Soft Computing. 23:1123-1131
This paper introduces the concepts of fuzzy tree pushdown automata and fuzzy context-free tree grammars. At first, we show that any fuzzy context-free tree grammar can be converted into a corresponding definition of fuzzy Chomsky normal form for tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bc79123e9f08b7abb807f42a02b8c7e
https://doi.org/10.1007/s00500-017-2829-7
https://doi.org/10.1007/s00500-017-2829-7
Publikováno v:
Prikladnaya diskretnaya matematika. :76-89
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f01e1f6aab59d90becce9b04e5c5ecf
https://doi.org/10.17223/20710410/37/6
https://doi.org/10.17223/20710410/37/6
Autor:
Diego Vaggione, Mariana V. Badano
Publikováno v:
Theoretical Computer Science. 676:92-96
In this note we present a simple condition upon which a formal grammar produces a context-free language. Fil: Badano, Mariana. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Mate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c1f1236b12569ae669bff28ac747d0f
https://doi.org/10.1016/j.tcs.2017.03.002
https://doi.org/10.1016/j.tcs.2017.03.002
Autor:
Gebhardt, Kilian
This thesis considers the problem of assigning a sentence its syntactic structure, which may be discontinuous. It proposes a class of models based on probabilistic grammars that are obtained by the automatic refinement of a given grammar. Different s
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A71398
https://tud.qucosa.de/api/qucosa%3A71398/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A71398/attachment/ATT-0/
Autor:
Heiko Vogler, Richard Mörbitz
We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs multioperator monoids as weight algebras. It generalizes previous work in that area (semiring parsing, weighted deductive parsing)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::233322afc582d1772c5f9cf6f089f67e
http://arxiv.org/abs/1911.06585
http://arxiv.org/abs/1911.06585