Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Petr Zemek"'
Autor:
Petr Zemek
Publikováno v:
Comenius-Jahrbuch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89467b0f9b84db77182282d42acf3caf
https://doi.org/10.5771/9783896659576-171
https://doi.org/10.5771/9783896659576-171
Autor:
Petr Zemek
Publikováno v:
Comenius-Jahrbuch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea8e81905a368e1a3a840b742836e7b2
https://doi.org/10.5771/9783896657916-125
https://doi.org/10.5771/9783896657916-125
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
Publikováno v:
Theoretical and Applied Informatics. 27:25-47
In the presented paper we discuss pure versions of pushdown automata that have no extra non-input symbols. More specifically, we study pure multi-pushdown automata, which have several pushdown lists. We restrict these automata by the total orders def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d770f87fddc88c24fa919b25df8f41b8
https://doi.org/10.20904/271025
https://doi.org/10.20904/271025
Autor:
Petr Zemek, Alexander Meduna
Publikováno v:
Acta Informatica. 51:327-337
This paper discusses finite automata regulated by control languages over their states and transition rules. It proves that under both regulations, regular-controlled finite automata and context-free-controlled finite automata characterize the family
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d737111736d86751f784a719f2ff943
https://doi.org/10.1007/s00236-014-0199-5
https://doi.org/10.1007/s00236-014-0199-5
Autor:
Alexander Meduna, Petr Zemek
Publikováno v:
Theoretical Computer Science. 516:127-132
This paper deals with regulated grammars. Specifically, it studies one-sided random context grammars. It demonstrates that any recursively enumerable language can be generated by these grammars with no more than two right random context rules.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5d7862f511181705f66c9d1ade09c5c
https://doi.org/10.1016/j.tcs.2013.11.009
https://doi.org/10.1016/j.tcs.2013.11.009
Publikováno v:
International Journal of Computer Mathematics. 91:1156-1169
In this paper, we address several open problems concerning pure grammar systems (pGSs) and their controlled versions. More specifically, we prove the following four results. (I) Regular-controlled pGSs having a single component define the family of r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed29fab329d4f36debe100952e80f5dc
https://doi.org/10.1080/00207160.2013.829214
https://doi.org/10.1080/00207160.2013.829214
Autor:
Petr Zemek, Alexander Meduna
Publikováno v:
International Journal of Computer Mathematics. 90:172-182
In generalized one-sided forbidding grammars GOFGs , each context-free rule has associated a finite set of forbidding strings , and the set of rules is divided into the sets of left and right forbidding rules . A left forbidding rule can rewrite a no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b737661e4a2246812cf3e59e90216f7
https://doi.org/10.1080/00207160.2012.723703
https://doi.org/10.1080/00207160.2012.723703
Autor:
Petr Zemek, Alexander Meduna
Publikováno v:
Fundamenta Informaticae. 123:289-304
Consider ET0L grammars. Modify them such that a set of permitting symbols and a set of forbidding symbols are attached to each of their rules, just like in random context grammars. A rule like this can rewrite a symbol if each of its permitting symbo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57382bdf3c9413f21ce0ee702280daa1
https://doi.org/10.3233/fi-2013-811
https://doi.org/10.3233/fi-2013-811
Autor:
Petr Zemek, Alexander Meduna
Publikováno v:
International Journal of Foundations of Computer Science. 23:1555-1578
The present paper proposes a new investigation area in automata theory — jumping finite automata. These automata work like classical finite automata except that they read input words discontinuously — that is, after reading a symbol, they can jum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::353621c0df0ed949d3a166304e0d7737
https://doi.org/10.1142/s0129054112500244
https://doi.org/10.1142/s0129054112500244