Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Anton Černý"'
Autor:
Anton Černý
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 5, Iss 1 (2002)
The i-th symbol of the well-known infinite word of Thue on the alphabet { 0,1} can be characterized as the parity of the number of occurrences of the digit 1 in the binary notation of i. Generalized words of Thue are based on counting the parity of o
Externí odkaz:
https://doaj.org/article/edea316ef9204cf9993f893e8ee7a907
Autor:
Hamed M. K. Alazemi, Anton Černý
Publikováno v:
Journal of Computer and System Sciences. 79:658-668
The Parikh matrix mapping is a morphism assigning to each word w over a k-letter alphabet a (k+1)i?(k+1) upper triangular matrix with entries expressing the number of occurrences in w of some specific subwords. To tackle the problem of ambiguity of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcbe7662dc4c37ec202c11425f41ebc2
https://doi.org/10.1016/j.jcss.2013.01.018
https://doi.org/10.1016/j.jcss.2013.01.018
Autor:
Anton Černý
Publikováno v:
Theoretical Computer Science. 491:33-46
Eugene Prouhet is considered to be one of the fathers of combinatorics on words. In his pioneering work, he constructed a solution to the equal powers problem in number theory (later known as the Prouhet?Tarry?Escott problem) based on positions of sy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d8154d5c13436c767247234c624ff88
https://doi.org/10.1016/j.tcs.2013.04.001
https://doi.org/10.1016/j.tcs.2013.04.001
Autor:
Anton Černý
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 44:209-228
Parikh matrices have become a useful tool for investigation of subword structure of words. Several generalizations of this concept have been considered. Based on the concept of formal power series, we describe a general framework covering most of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3dcd3825d2454dd7de7d7048ae4a2e26
https://doi.org/10.1051/ita/2009021
https://doi.org/10.1051/ita/2009021
Autor:
Anton Černý
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783319049205
LATA
LATA
Based on the original approach of Eugene Prouhet, using composition of morphism-like array-words mappings, we provide a construction of solutions to the multi-dimensional Prouhet-Tarry-Escott problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ddbcbf8ad3787c6e97f999e0551593c
https://doi.org/10.1007/978-3-319-04921-2_22
https://doi.org/10.1007/978-3-319-04921-2_22
Autor:
Ľudovít Niepel, Anton Černý
Publikováno v:
COMPUTING AND INFORMATICS; Vol 27, No 4 (2008): Computing and Informatics; 581-591
The problems of determining the maximum cardinality of an independent set of vertices and the minimum cardinality of a maximal independent set of vertices of a graph are known to be NP-complete. We provide efficient algorithms for finding these value
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=issn13359150::07227cf51944f219e1f4b7c8c5f84c89
http://www.cai.sk/ojs/index.php/cai/article/view/233
http://www.cai.sk/ojs/index.php/cai/article/view/233
Autor:
Anton Černý
Publikováno v:
Mathematical Foundations of Computer Science 1984 ISBN: 3540133720
MFCS
MFCS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85f46569fd5c2a863f61ee6613bf75dc
https://doi.org/10.1007/bfb0030303
https://doi.org/10.1007/bfb0030303
Autor:
Anton Černý
Publikováno v:
Mathematical Foundations of Computer Science 1991 ISBN: 9783540543459
MFCS
MFCS
Linear cellular automata with left-to-right communication are used for generating words. The terminal state of each cell corresponds to the symbol generated in the given position. In nondeterministic case such an automaton describes a language. The c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cbec762e99285f306e6a1a6f71acb4e
https://doi.org/10.1007/3-540-54345-7_54
https://doi.org/10.1007/3-540-54345-7_54
Autor:
Anton Černý
Publikováno v:
RAIRO. Informatique théorique. 19:337-349
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a0bf2f625c2151cb3210e7500427850
https://doi.org/10.1051/ita/1985190403371
https://doi.org/10.1051/ita/1985190403371
Autor:
Anton Černý
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540083535
MFCS
MFCS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f39c9dbeef4f87b293ce1c08650ecb44
https://doi.org/10.1007/3-540-08353-7_144
https://doi.org/10.1007/3-540-08353-7_144