The completeness modulo ideal in functional systems of a program type

Articles in the same Issue

1. On the edge-independence number and edge-covering number for regular graphs
2. Systems of antiprefix equations in words
3. On word colourings and some perfect graphs
4. Optimal search of extremums of convex functions on lattices
5. The completeness modulo ideal in functional systems of a program type
6. On the solution of systems of automaton equations
7. Some conditional distributions for random graphs
8. Randomized decomposable statistics in the scheme of independent allocating particles into boxes
9. On the number of cycles in a random non-equiprobable graph