Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Dainis Geidmanis"'
Autor:
Valts Liepins, Pauls Sondors, Linards Goldšteins, Juris Sennikovs, Dainis Geidmanis, Anatolijs Ziks
Publikováno v:
International Journal of Applied Electromagnetics and Mechanics. 63:S93-S100
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05cc088e3d3b94a5beb307abf9d2eaad
https://doi.org/10.3233/jae-209105
https://doi.org/10.3233/jae-209105
Autor:
Dainis Geidmanis
Publikováno v:
Lecture Notes in Computer Science ISBN: 3540529535
MFCS
MFCS
Synchronized alternating machines generalize alternating ones, similarly alternating machines generalize nondeterministic ones. We are interested in the following questions: 1) what is the simplest kind of device working over the single-letter alphab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac030cb72d953ae7424318a4307cdfa2
https://doi.org/10.1007/bfb0029621
https://doi.org/10.1007/bfb0029621
Publikováno v:
Randomization and Approximation Techniques in Computer Science ISBN: 9783540632481
RANDOM
RANDOM
Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0039d6585fe0b7be3f73699918a3eab1
https://doi.org/10.1007/3-540-63248-4_16
https://doi.org/10.1007/3-540-63248-4_16
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540633570
COCOON
COCOON
We consider k-tape 1-way alternating finite automata (k-tape lafa). We say that an alternating automaton accepts a language L\(\subseteq\)(Σ*)k with f(n)-bounded maximal (respectively, minimal) leaf-size if arbitrary (respectively, at least one) acc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b7c843b783c634075f62a599b73bb94
https://doi.org/10.1007/bfb0045109
https://doi.org/10.1007/bfb0045109
Autor:
Dainis Geidmanis
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783540187400
FCT
FCT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60421d56c1070a2ef87f4d0ff35dffdc
https://doi.org/10.1007/3-540-18740-5_35
https://doi.org/10.1007/3-540-18740-5_35