Fundamenta Informaticae > 2015 > Vol. 139, nr 1 > 1--19
Source
Abstract
Identifiers
journal ISSN : | 0169-2968 |
journal e-ISSN : | 1875-8681 |
DOI | 10.3233/FI-2015-1223 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
[1] van Aardenne-Ehrenfest, T., de Bruijn, N. G.: Circuits and trees in oriented linear graphs, Simon Stevin, 28, 1951, 203–217, ISSN 0037-5454.
-
[2] Calude, C. S., Salomaa, K., Roblot, T. K.: Finite-State Complexity and Randomness, Technical Report 374, University of Auckland CDMTCS Research Report Series, December 2009.
-
[3] Chebolu, S. K.,Min´aˇc, J.: Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle, Mathematics Magazine, 84(5), 2011, 369–371.