Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Zbyněk Křivka"'
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
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
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 52:185-199
The present paper modifies and studies jumping finite automata so they always perform two simultaneous jumps according to the same rule. For either of the two simultaneous jumps, it considers three natural directions – (1) to the left, (2) to the r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9c9bfb15b0b5440a871b3c8d32bc03d
https://doi.org/10.1051/ita/2018013
https://doi.org/10.1051/ita/2018013
Publikováno v:
The Computer Journal. 62:30-41
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3e896392b8d15a5570ae82df5f90139
https://doi.org/10.1093/comjnl/bxy027
https://doi.org/10.1093/comjnl/bxy027
Publikováno v:
The Computer Journal. 59:1180-1185
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::909e80093f59fc98908c4c114e9924a4
https://doi.org/10.1093/comjnl/bxw001
https://doi.org/10.1093/comjnl/bxw001
Autor:
Zbyněk Křivka, Alexander Meduna
Publikováno v:
International Journal of Foundations of Computer Science. 26:709-731
This paper introduces and studies jumping grammars, which represent a grammatical counterpart to the recently introduced jumping automata. These grammars are conceptualized just like classical grammars except that during the applications of their pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17e09f1846926594d957c59f294df1b3
https://doi.org/10.1142/s0129054115500409
https://doi.org/10.1142/s0129054115500409
Publikováno v:
International Journal of Foundations of Computer Science. 17:1223-1229
This paper introduces and discusses #-rewriting systems, which represent language-generating devices that resemble automata by using finitely many states without any nonterminals. It demonstrates that these systems characterize the well-known infinit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfcec360637642cb8ff88df81d012be8
https://doi.org/10.1142/s0129054106004352
https://doi.org/10.1142/s0129054106004352