Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Martin Plátek"'
Autor:
Martin Plátek, Friedrich Otto
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 219-233 (2017)
Following some previous studies on restarting automata, we introduce a refined model - the h-lexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the
Externí odkaz:
https://doaj.org/article/f568339aabc14303819c95b3dd4b798a
Publikováno v:
International Journal of Foundations of Computer Science. 33:371-387
Here we establish and study some rigorous tools suitable for the lexicalized syntactic analysis (LSA) of natural and formal languages. Motivated by the linguistic method of analysis by reduction, we are interested in correctness preserving LSA. We in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f22a4ef1fefaaece4229f255b2423e7
https://doi.org/10.1142/s0129054122410106
https://doi.org/10.1142/s0129054122410106
Autor:
Jiří Šíma, Martin Plátek
Publikováno v:
Neural Information Processing ISBN: 9783030367176
ICONIP (3)
ICONIP (3)
We analyze the computational power of discrete-time recurrent neural networks (NNs) with the saturated-linear activation function within the Chomsky hierarchy. This model restricted to integer weights coincides with binary-state NNs with the Heavisid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfa2680593232b1ed01225490885ae74
https://doi.org/10.1007/978-3-030-36718-3_7
https://doi.org/10.1007/978-3-030-36718-3_7
Publikováno v:
Fundamenta Informaticae. 133:399-419
In natural languages with a high degree of word-order freedom, syntactic phenomena like dependencies (subordinations) or valences do not depend on the word-order (or on the individual positions of the individual words). This means that some permutati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4931704bb5a0683a47a1fc6ad867ff1a
https://doi.org/10.3233/fi-2014-1083
https://doi.org/10.3233/fi-2014-1083
Publikováno v:
Theoretical Computer Science. 410(37):3530-3538
Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4ab10d5615667e29f2e1643acd2393d
Publikováno v:
International Journal of Foundations of Computer Science. 18:1343-1352
Restarting automata can be considered as a machine model as well as regulated rewriting systems. We introduce a measure of ambiguity for restarting automata which recognizes a language as a projection of its characteristic language (containing also a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae678870546838a482ef9a5b635c1b78
https://doi.org/10.1142/s0129054107005388
https://doi.org/10.1142/s0129054107005388
Publikováno v:
Theory of Computing Systems. 42:488-518
The $\mathsf{R}$-automaton is the weakest form of the nondeterministic version of the restarting automaton that was introduced by Jancar et al. to model the so-called analysis by reduction. Here it is shown that the class ℒ(R) of languages that are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45cdf2ea78663789f9bb9c29535906b3
https://doi.org/10.1007/s00224-007-9004-y
https://doi.org/10.1007/s00224-007-9004-y
Publikováno v:
Theoretical Computer Science. 369(1-3):1-34
In the literature various notions of monotonicity for restarting automata have been studied. Here we introduce two new variants of monotonicity for restarting automata and for two-way restarting automata: left-monotonicity and right-left-monotonicity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26559cfb7db9d36d215508d0dbf78804
Publikováno v:
Theoretical Computer Science. 366:272-296
The t-contextual grammars are generalizations of Marcus contextual grammars, which insert t contexts in each derivation step. If the selection mappings are regular and satisfy an additional locality restriction, then these grammars correspond in thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df7142255bb2a0bc61c920011f1269fe
https://doi.org/10.1016/j.tcs.2006.08.027
https://doi.org/10.1016/j.tcs.2006.08.027
Publikováno v:
Formal Grammar ISBN: 9783662441206
FG
ResearcherID
FG
ResearcherID
The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::282baad0e16de894cea8e9a627345aa8
https://doi.org/10.1007/978-3-662-44121-3_10
https://doi.org/10.1007/978-3-662-44121-3_10