|
This article is cited in 3 scientific papers (total in 3 papers)
Computer Sciences
The geometric form of automaton mappings, recurrent and $Z$-recurrent definition of sequences
V. A. Tverdokhlebovab a Institute of Precision Mechanics and Control, Russian Academy of Sciences, 24, Rabochaya st., 410028, Saratov, Russia
b Saratov State University, 83, Astrakhanskaya st., 410012, Saratov, Russia
Abstract:
For automaton mappings we present a method to construct geometric images, a method for complexity estimate by geometric forms, a method of $Z$-recurrent definition of sequences. A method for complexity estimate for finite sequences by recurrent and $Z$-recurrent numerical indicators is proposed. Numerical indicators of recurrent and $Z$-recurrent definitions of sequences are systematized into the spectrum of recurrent definitions with 5 levels of numerical indicators. The spectrum includes the order of a recurrent form, the numerical characteristics of various types of recurrent sequences, etc.
Key words:
automaton mappings, geometric images, recurrent sequence, $Z$-recurrent sequences, sequences, complexity estimate of a sequence.
Citation:
V. A. Tverdokhlebov, “The geometric form of automaton mappings, recurrent and $Z$-recurrent definition of sequences”, Izv. Saratov Univ. Math. Mech. Inform., 16:2 (2016), 232–241
Linking options:
https://www.mathnet.ru/eng/isu641 https://www.mathnet.ru/eng/isu/v16/i2/p232
|
Statistics & downloads: |
Abstract page: | 230 | Full-text PDF : | 90 | References: | 42 |
|