Zobrazeno 1 - 10
of 167
pro vyhledávání: '"Alexander Meduna"'
Autor:
Alexander Meduna, Martin Havel
Publikováno v:
Computer Science Journal of Moldova, Vol 30, Iss 2(89), Pp 135-147 (2022)
The present paper describes an alternative algorithm for the removal of erasing rules from E0S grammars. As opposed to the standard way of eliminating erasing rules in most E0S-like grammars, such as context-free grammars, this method requires no pre
Externí odkaz:
https://doaj.org/article/4c8de516d32e415e9a8f04413aae6d84
Publikováno v:
Computer Science Journal of Moldova, Vol 27, Iss 3(81), Pp 255-282 (2019)
Let $O$ and $\F$ be an operation and a language family, respectively. So far, in terms of closure properties, the classical language theory has only investigated whether $O(\F) \subseteq \F$, where $O(\F)$ is the family resulting from $O$ applied to
Externí odkaz:
https://doaj.org/article/9ad3025da7f749789e02612018ef3d87
Autor:
Alexander Meduna, Jakub Martiško
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 170-179 (2017)
The L(PSCG)=L(CS) problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this problem in terms of CD grammar systems. More specifically, it characterizes
Externí odkaz:
https://doaj.org/article/586bcea5853b4a1db7814996b148a010
Autor:
Tomáš Masopust, Alexander Meduna
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 3, Iss Proc. DCFS 2009, Pp 183-192 (2009)
Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that construction, the maximal number of nonterminals simultaneously rewritten du
Externí odkaz:
https://doaj.org/article/a50b58849d2b468e8a430101c2ea7fb1
Publikováno v:
International Journal of Foundations of Computer Science. 33:335-348
The [Formula: see text] problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this problem in terms of CD grammar systems. More specifically, it charact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e17caf35e8ec0f845312907b6023064
https://doi.org/10.1142/s0129054122410088
https://doi.org/10.1142/s0129054122410088
Publikováno v:
Acta Informatica. 59:557-584
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e64a94ee12c9b96e434cfeb1dc84b4f3
https://doi.org/10.1007/s00236-021-00413-x
https://doi.org/10.1007/s00236-021-00413-x
Publikováno v:
Kybernetika. :856-877
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e0fbe71152eb45ec06e5e337b90023c
https://doi.org/10.14736/kyb-2021-5-0856
https://doi.org/10.14736/kyb-2021-5-0856
Autor:
Alexander Meduna, Zbyněk Křivka
Publikováno v:
Fundamenta Informaticae. 179:361-384
This paper investigates the reduction of scattered context grammars with respect to the number of non-context-free productions. It proves that every recursively enumerable language is generated by a scattered context grammar that has no more than one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::828a71244fbcb90631d25de0c37bf1f7
https://doi.org/10.3233/fi-2021-2028
https://doi.org/10.3233/fi-2021-2028
Autor:
Alexander Meduna, Zbyněk Křivka
Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their
