Zobrazeno 1 - 10
of 95
pro vyhledávání: '"periodic languages"'
Autor:
Bresolin, Davide1 bresolin@sci.univr.it, Montanari, Angelo2 angelo.montanari@dimi.uniud.it, Puppis, Gabriele2 gabriele.puppis@dimi.uniud.it
Publikováno v:
Acta Informatica. Aug2009, Vol. 46 Issue 5, p331-360. 30p. 9 Diagrams, 1 Chart.
Publikováno v:
Journal of automata, languages and combinatorics. :255-261
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=CSC_________::8664593c6c2df41d6655b4504a901116
http://juuli.fi/Record/0246349112
http://juuli.fi/Record/0246349112
Publikováno v:
Acta Informatica
Acta Informatica, Springer Verlag, 2009, 46 (5), pp.331-360. ⟨10.1007/s00236-009-0094-7⟩
Acta Informatica, Springer Verlag, 2009, 46 (5), pp.331-360. ⟨10.1007/s00236-009-0094-7⟩
International audience; In this paper, we develop a theory of regular omega-languages that consist of ultimately periodic words only and we provide it with an automaton-based characterization. The resulting class of automata, called Ultimately Period
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0316564a0cb62d506cdb5a54b7875b19
https://hal.archives-ouvertes.fr/hal-00717805
https://hal.archives-ouvertes.fr/hal-00717805
Autor:
Honkala, Juha
A language $L\subseteq X^*$ is called ultimately periodic if there exist a word $u\in X^*$ and a finite set $F\subseteq X^*$ such that all words of $L$ are prefixes of the words in $Fu^*$. We characterize ultimately periodic regular and context-free
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43766bf22c21982c094c8bdb30aaa095
Autor:
Alessandro Candeloro, Carlo Mereghetti, Beatrice Palano, Simone Cialdi, Matteo G. A. Paris, Stefano Olivares
Publikováno v:
Applied Sciences, Vol 11, Iss 18, p 8768 (2021)
In a recent paper we have described an optical implementation of a measure-once one-way quantum finite automaton recognizing a well-known family of unary periodic languages, accepting words not in the language with a given error probability. To proce
Externí odkaz:
https://doaj.org/article/24f0f5fb3e074bbba23e1900a619537d
Autor:
Beatrice Palano, Simone Cialdi, Stefano Olivares, Matteo G. A. Paris, Alessandro Candeloro, Carlo Mereghetti
Publikováno v:
Applied Sciences
Volume 11
Issue 18
Applied Sciences, Vol 11, Iss 8768, p 8768 (2021)
Volume 11
Issue 18
Applied Sciences, Vol 11, Iss 8768, p 8768 (2021)
In a recent paper we have described an optical implementation of a measure-once one-way quantum finite automaton recognizing a well-known family of unary periodic languages, accepting words not in the language with a given error probability. To proce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::779b6ff6179ddbe0c92d6b643d87597d
http://arxiv.org/abs/2109.10101
http://arxiv.org/abs/2109.10101
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.