On one definition of grammatical categories
On one language with connection to determinism and bounded deleting
On one NP-complete problem
On one of the boundaries of the constituent conception of grammar
On optimal methods in numerical analysis
Round-off error analysis of the gradient method.
On parallel deletions applied to a word
On parameters of an evaluation function for heuristic search as a path problem
On permutations generated by infinite binary words.
On polynomial time decidability of induced-minor-closed classes
On possible growths of arithmetical complexity
The arithmetical complexity of infinite words, defined by Avgustinovich, Fon-Der-Flaass and the author in 2000, is the number of words of length n which occur in the arithmetical subsequences of the infinite word. This is one of the modifications of the classical function of subword complexity, which is equal to the number of factors of the infinite word of length n. In this paper, we show that the orders of growth of the arithmetical complexity can behave as many sub-polynomial functions. More...
On proofs of correctness of well-structured programs
On proofs of correctness of well-structured programs. II
On pseudo-random sequences and their relation to a class of stochastical laws
On quasi-homomorphisms and compositions of automata
On -fuzzy Petri nets.
On racial insufficiency: White messengers cannot simulate coloured ones
On ranking 1-way finitely ambiguous NL languages and -complete census functions
On rational solution of the state equation of a finite automaton.
On real time and linear time cellular automata
On related transducers