LIST of PUBLICATIONS

 


 

 Articles in periodicals

 


 

51  A Note on a Recent Attempt to Improve the Pin-Frankl Bound

     DM & TCS, 1(17), 2015, 307-308 with François Gonze, Raphaël M. Jungers

 

50 An algorithm for road coloring. J. Discr. Alg. 213–223, 16 (2012) 

 

 49. Some new Features and Algorithms for the Study of DFA, Open J. Discr. Math., 2(2), 2012, 45-50

 

 48. An Algorithm for Road Coloring. Lect. Notes in Comp. Sci, 7056 (2011), Springer, 349--360

 47 A Partially Synchronizing Coloring, Lect. Notes in Comp. Sci, 6072(2010) Springer, , 363-370

 46. The road coloring problem, Israel J. of Math. , 172(1), 2009, 51-60

45. Some aspects of synchronization of DFA.  J. Comput. Sci. & Technol., 23(5) 2008, 719-727.

44. Synchronizing Road Coloring.  5-th IFIP  WCC-TCS, Springer, 273(2008), 43-53

43. The Road Coloring and Cerny Conjecture. Proc. of Prague Stringology Conference.  2008, 1-12.

42. Synchronization of some DFA. Lect. Notes in Comp. Sci, Springer, TAMC 2007, 4484(2007), 234-243.

41.  The Cerny Conjecture for Aperiodic Automata.  Discr. Math. & Theoret. Comput. Sci. v. 9 2(2007),  3-10.

40. Response to the "Comment on 'The moisture from the air as water resource in arid region: Hopes, doubt and facts' by Beysens et al"., with B Kogan, J. of Arid Env., 2, 67(2006), 353-356

39. Notable trends concerning the synchronization of graphs and automata. El. Notes in Discr. Math., 25(2006), 173-175

38. An eficient algorithm finds noticeable trends and examples concerning the Cerny conjecture. Lect. Notes in Comp. Sci, Springer, MFCS 2006, 4162(2006), 789-800.

37. Reducing the time complexity of testing for local threshold testability. Theoret. Comput. Sci., 328(2004), 151-160.

36. Verification of algorithms for checking some kinds of testability. In Algebraic Methods in Language Processing, TWLT 21, eds. F.Spoto, G. Scollo, A. Nijholt. 2003, 253-263.


35. Reducing the time complexity of testing for local threshold testability, Lect. Notes in Comp. Sci, 2759(2003), 141-148.

34. A package TESTAS for checking some kinds of testability. Lect. Notes in Comput. Sci., 2608(2003), 228-232.

33. A polynomial time algorithm for left [right] local testability. Lect. Notes in Comput. Sci., 2608(2003), 203-212.

32. Identities of locally threshold testable semigroups, in C. Martin-Vide & V. Mitrana, eds, Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, and Back. Taylor and Francis, London, 2003, 347-356.

31. The Moisture from the Air as Water Resource in Arid Region: Hopes, Doubts and Facts, with B Kogan. J. of Arid Env., London, 2, 53(2003), 231-240.

30. An algorithm to verify local threshold testability of deterministic finite automata, Lect. Notes in Comp. Sci, 2214(2001), 164-173.

29. Algorithms verifying local threshold and piecewise testability of semigroup and solving Almeida problem. in T. Imaoka eds. Alg. semigroups, formal languages and computation. RIMS Kokyuroku Proceedings, 1222(2001), 145-151.

28. Piecewise and local threshold testability of DFA. Lect. Notes in Comp. Sci, 2138(2001), 347-358.

27. Algorithms finding the order of local testability of deterministic finite automaton and estimation of the order. Theoret. Comput. Sci., 235(2000), 183-204.


26. Optimal estimation on the order of local testability of finite automata. Theoret. Comput. Sci., 231(2000), 59-74.

25. Identities of locally testable semigroups. Comm. Algebra, 27(1999), no. 11, 5405-5412.

24. Precise estimation on the order of local testability of deterministic finite automaton. Lect. Notes in Comput. Sci, 1436(1998), 198-212.


23. A polynomial time algorithm for local testability and its level. Int. J. Algebra Comput., 9(1998), no.1, 31-39.


22. Identities of a five-element 0-simple semigroup. Semigroup Forum, NY, 48(1994), 385-387.

21. Locally testable semigroups. Contributions of Workshop on semigroups and connected questions, Open Univ., T-A, 1993, 33-35.

20. Finiteness of a basis of identities of 5-element semigroups. Polugruppy i ih gomomorphismy, Ross. Gos. ped. Univ., Leningrad, 1991, 76-98.


19. A sixelement semigroup that generates a variety with a
 continuum of subvarieties. Ural Gos. Univ. Mat. zap., Alg. syst. i ih mnogoobr., Sverdlovsk, 14(1988), no. 3, 138-143.


18. Some finite infinitely based semigroups. Ural Gos. Univ. Mat. zap., Issl. algebr. system, Sverdlovsk, 14(1987), no. 2, 128-133.

17. Semigroups all of whose proper subsemigroups are cancellation semigroups. Ural Gos. Univ. Mat. zap.,. Issl. po algebr. syst. Sverddlovsk, 13(1984), no. 4, 152-156.

16. The finite basis question for semigroups of order less than six. Semigroup Forum, NY, 27(1983), 387-389.


15. The varieties of n-testable semigroups. Semigroup Forum, 27(1983), NY, 309-318.


14. A basis of identities of a 5-element Brandt semigroup. Issled. po sovremen. Alg., Ural Gos. Univ. Mat. zap., Sverdlovsk, 12(1981), no. 3, 147-149.

13. Resonant loads in many-mass schemes under outer force influence. Dinamica i prochnost tjagelyh mashin, Dnepropetrovsk, (with S. Kazak) 1980, 29-32.

 12. Study of dinamics using calculation of discret schemes. Teorija mashin i met. gorn. ob., Sverdlovsk, rel. 2, (with S. Kazak) 1979, 36-44.

11. Loads in many-mass schemes stopping last mass. Teorija mashin i met. gorn. ob., Sverdlovsk, rel. 2, (with G. Kozhushko) 1979, 46-58.

10. Calculation of load in discret chains. Teorija mashin i met. gorn. ob. Sverdlovsk, rel. 1, (with S.Kazak, G Kozhushko) 1978, 39-51.

9. A variety of semigroups without an irreducible basis of identities. Math. Zametky, Moscow, 21(1977), 865-871.

8. Subsemigroup graphs, and lattices of subsemigroups. Izv. VUZov. Math., Kazan, 1976, no. 2(165), 131-145.

7. mV-semigroups of certain varieties. Alg. issl., Publ. Centr. of Ural PI, Sverdlovsk, 1975, 107-118.

6. Semigroups whose proper subsemigroups all belong to a certain variety. Ural Gos. Univ. Mat. zap., Sverdlovsk,. 9(1974), no.1, 110-126.


5. Covering elements in the lattice of varieties of universal algebras. Mat. Zametky, Moscow, 15(1974), 307-312. 


4. Die einstufig nichtcommutativen Halbgroppen mit Ausnahme von unendlichen gruppen.
Periodica Math. Hungarica., Budapest, 1(1971), no. 1 (with L. Redei), 15-23.

3. Lattice isomorphisms of matrix bands of nonperiodic commutative semigroups with cancellation law. Ural Gos. Univ. Mat. zap., Sverdlovsk, 7(1969), no. 1, (with V. Baranski), 3-22. .

2. Subsemigroup graphs. Mat. Casopis Sloven. Acad. Vied, Bratislava, 20 (1968), no.2, (with V. Baranski), 135-141.

1. Half-isomorphisms of matrix bands of semigroup with cancellation law. Ural Gos. Univ. Mat. zap., Sverdlovsk, .6 (1968) no. 3 (with V. Baranskij), 1-11.


 

Textbooks

 




1 Analytical geometry, Publ. Centr. of Ural PI. Sverdlovsk, 1982.

2 General algebra, Publ. Centr. of Ural PI. Sverdlovsk, 1983.


 

Papers presented on scientific conferences

 


 

 75. An Algorithm for Road Coloring. Int. l Workshop on Comb.. Alg ,Victoria, June, 2011

 

74. Modifying the upper bound on the length of minimal synchronizing word. 18 Int.Symp. on Fund.of Comput.Theory ,Oslo, 2011

73. Upper bound on the length of the reset word.  Dynamical asp. of Autom. and Semigr. Theor. Vienna, Nov 2010. 14   

72.  A Partially Synchronizing Coloring, 4-th Comput. Sci. Symp. in Russia, Kazan, June 2010

71  Linear visualization of a Road Coloring. 9 Cologne Twente workshop on graphs and Comb. Optim., Cologne 2010, 13-16  (with Bauer T., Cohen N.)

70.  The Problems around the Road Coloring and Cerny Conjecture. Salomaa Symp. Information proc., Turku, Finland, May. 2009.

69. Road Coloring Problem. Implementation and Visualization of the Algorithm. AMS-SMS joint meeting, Shanghai, Dec. 2008, 109-110.

68. Synchronizing Road Coloring.  World Computer Congress, 5-th Int.Conf. on Theoret. Comput. Sci., Milan, Italia, invited lecture, Sept. 2008, 43-53.

67. The Road Coloring and Cerny Conjecture. Prague Stringology Conference. Prague, Czechia, invited lecture, September, 2008, 1-12.

66. The implementation of the Algorithm of Road Coloring. 12-th Mons Theoret, CS Days. Mons, Wallonie, invited lecture, August, 2008

65. Some aspects of  Synchronizing Road Coloring. Workshop "Around the Cerny conjecture". Wroclaw, Poland, June, 2008.

64. The Road Coloring Problem. Algebraic aspects  of the Proof and Corresponding Algorithms. Annual Meeting of IMU, Alg. Comb. and Graph Theory. Ashkelon, Israel, May, 2008.

63. The visualization of digraph based on its structure properties. with T. Bauer, N.Cohen. Conf. in Representation Theory of Algebras, Groups and Semigroups. Ramat-Gan, Israel, December , 2007.

62. Synchronization of some DFA. 4th Annual Conf. on Theory and Appl. of Models of Comput. Shanghai, China, May , 2007.

61. An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture. 31st Int. Symp. on Math. Found. of Comput. Sci. Bratislava, Slovakia, Aug. 2006.


60. Semigroup approach to one of the oldest problem in finite automata. Third Int. Conf. of Appl. Math., Plovdiv, Bulgaria, Aug. 2006.

59. Computation of some examples and notable trends concerning the synchronization. 4-th Workshop in Appl. and Comp. Math. Tel-Aviv, Israel, Jan. 2006.

58. Notable trends concerning the synchronization of graphs and automata. Cologne-Twente Workshop on Graphs and Comb. Opt., Lambrecht, Germany, June 2006.


57. 40 years of the Cerny conjecture - one of the oldest problems in automata theory. Second Int. Conf. of Appl. Math., Plovdiv, Bulgaria, Aug. 2005.

56. Some recent results concerning the Cerny conjecture. 5-th Haifa Workshop on on Interdisciplinary Appl. of Graph Theory, Combinatorics and Algorithms, Haifa, May 2005.

55. Some results of implemented algorithms of synchronization. 10-th Journees Montoises d'Inform. Theor., LIege, Belgia, Sep. 2004.

 

54. Cerny conjecture for DFA accepting star-free languages. ICALP, Workshop on synchronizing automata, Turku, Finland, July 2004


53. Verification of algorithms for checking some kinds of testability. Third AMAST Workshop on Language Processing, AMiLP 2003. Verona, Italy, Aug. 2003.


52. Reducing the time complexity of testing for local threshold testability. 8-th Int. Conf. on Implementation and Application of Automata. Santa Barbara, USA, July 2003.

51. Graph representation for locally testable automata and generalizations. Algorithms and programs. Third Haifa Workshop on Interdisciplinary Appl. of Graph Theory, Combinatorics and Algorithms, Haifa, Israel, May 2003.

50. A package TESTAS for checking some kinds of testability. Proc. of 7-th Int. Conf. on Implementation and Application of Automata. Tours, France, July 2002, 223-238.

49. A polynomial time algorithm for left [right] local testability. Proc.of 7-th Int. Conf. on Implementation and Application of Automata. Tours, France, July 2002, 201-210.

48. Local testability and generalizations.Some implemented algorithms. Int. Conf. on Semigroups and Groups. Porto, Portugal, June 2002, 42.

47. The Existence of Synchronizing Word and Cerny Conjecture for Some Finite Automata. Second Haifa Workshop on Graph Theory, Combinatorics and Algorithms, Haifa, June 2002.

 

46. A package for checking some kinds of semigroup and automata testability. Isr. Math. Soc. annual session. Tel-Aviv, Apr. 2002.
 

45. Local testability of semigroups. Int. Conference on Algebra and its Application, Bangkok, Tailand, March 2002.
 

44. Piecewise and local threshold testability of DFA. Lect. Notes in Comp. Sci, 2138(2001), 347-358, 13 Int. Symp. on Fund. of Comput. Theory., Riga, Latvia, Aug. 2001.


43.A package for checking some kinds of testability. with D. Belostotski, D. Kravtsov, A. Shemshurenko, M. Sobol, Sh. Yakov Conference on Implementation and Application of Automata, CIAA2001, Pretoria, South Africa, July 2001.
 

42.A package for checking some star-free languages. Implemented algorithms. with D. Belostotski, D. Kravtsov, A. Shemshurenko, M. Sobol, Sh. Yakov, Bar_ilan Int. Symp. on the Foundation of Art. Intelligence, Ramat Gan, Israel, June 2001.

41. Locally, locally threshold and piecewise testable languages. Some implemented algorithms. with D. Belostotski, D. Kravtsov, A. Shemshurenko, M. Sobol, Sh. Yakov, Discrete Math. and Theor. Comput. Sci., Constanca, Romania, July 2001.

40. A package for manipulating finite state automata and semigruops. with D. Belostotski, D. Kravtsov, A. Shemshurenko, M. Sobol, Sh. Yakov, Brazilian Symp. on Graphs, Alg. and Combinatorics, Fortaleza, Brazil, March 2001.

39. Algorithms verifying local threshold and piecewise testability of semigroup and solving Almeida problem. Workshop on Algebraic semigroups, formal languages and computation, Kyoto, Yapan, February 2001.

38. Verifying piecewise testability of deterministic finite automaton. Fifth International Conference on Implementation and Application of Automata, CIAA2000, London, Ontario, Canada, Yuly 2000.


37. Computing the order of local testability. Descriptional Complexity of Automata, Grammars and Related Structures, Magdeburg, Germany, July 1999.

 

36. An algorithm to verify local threshold testability of deterministic finite automaton. 4 International Workshop on Implementing of Automata, WIA99, Potsdam, Germany, July 1999.


35. Local threshold testability. The Second Semigroup Conference, St.-Petersburg, Russia, July 1999.

 

34. Locally threshold testable semigroups. International Conference on Semigroups, Braga, Portugal, June 1999.

33. Atmospheric precipitation as water resource. (with B. Kogan), The 7th International conference on Environmental Challenges for the Millenium. Jerusalem, Israel, Yune 1999.

 32. Algorithms finding the order of local testability and estimations of the order. International Conference on Theoretical Computer Science, Hong Kong, China, Apr. 1998.

31. Precise upper bound for the order of local testability of finite automaton. 2 International Workshop on Implementing of Automata, WIA97, London, Ontario, Canada, Sep. 1997.

30. Precise upper bound of the order for local testability. Lectures of abstracts, Semigroups and application, Conf. St. Andrew, Scotland, July 1997.

29. Locally testable semigroups. Semigroups and connected questions, Workshop, T-A, Israel, Dec. - Jan. 1992-1993.

28. Software of the tasks of locating of the size and symbol information in the mashine graphics. 4-th All-union conf. on mashine graphics, Protvino, (Russian) 1987.

27. On some convienent applied programs in the tasks of the mashine graphics. Applications of new materials, advanced processes and CAD in mashine building, Sverdlovsk, (Russian) 1987.

26. On some algorithms of locating of the symbol information in tasks of the mashine graphics. Theoretical and applied informatics, Sverdlovsk, (Russian) 1986.

25. Interface with interactive systev for graphical display of bounded memory. Theoretical and applied informatics, Sverdlovsk, (Russian) 1986.

24. Hierarchy in the location of patterns. CAD of mashines, installations and processes in mashine building. Ustinov, (Russian) 1986.

23. About some conceptual model of database system for graphical display. Informational systems, Sverdlovsk, (Russian) 1985.

22. The identities of testable semigroups. 17-th All-union alg. conf., Minsk, (Russian) 1983.

21. The preparation of data and the design of the blade stamp gorizontal projection. 11-th sci.-techn. conf. of Ural PI, Sverdlovsk, 1983. (with A. Lobanov and L. Shitova, Russian)

20. Data organization in the design system of blade stamps.11-th sci.-techn. conf. of Ural PI, Sverdlovsk, (Russian) 1983.

19. The size information locating in the plain of the draught. Republic CAD conf. Sverdlovsk, (Russian) 1982.
 

18. The task of appointment of inclinations. The use of CAD in mashine building. Sverdlovsk, (Russian) 1982.
 

17. The program of the locating of size information in the draught plain. Sci.-techn. conf. of CAD, Perm, (with N. Semkova, Russian) 1981


16. The basis of identities of 5-element semigroups.16-th All-union alg. conf., Leningrad, (Russian) 1981.

 

15. Locating of the size information in the plain of the draught. Automatization of technological preparation on the region enterprises, Sverdlovsk, (with G. Shafarenko, Russian ) 1980
 

14. On some varieties of semigroups generated by finie semigroups. 15-th All-union alg. conf., Krasnojarsk, (Russian) 1979.
 

13. An infinitely basable quasivariety of idempotent semigroups. 2-th All-union semigroup conf., Sverdlovsk, (Russian) 1979.

12. On discretization of continual system by study of longitudinal dinamics of conveyor belts. 1-th All-union conf. on the theory of mashynery, Alma-Ata, (with G. Kozhushko, Russian) 1978

11. Covering elememnts in the lattice of varieties of algebras and irreducible basis of identities. 14-th All-union alg. conf., Novosibirsk, (Russian) 1977.

10. mV-semigroups of certain varieties. 5-th sci.-techn. conf. of Ural PI, Sverdlovsk, (Russian) 1976

9. A variety of semigroups without an irreducible basis of identities. 13-th All-union alg. coll., Gomel, (Russian) 1975.

8. Covering varieties and mV-semigroups. 12-th All-union alg. coll. Sverdlovsk, (Russian) 1973

7. Infinit Miller-Moreno groups. 4-th sci.-techn. conf. of Ural PI, Sverdlovsk, (Russian) 1973
 

6. Semigroups whose proper subsemigroups all have Q-property. 11-th All-union alg. coll. Kishinev, (Russian) 1971.
 

5. On subsemigroup graphs. 11-th All-union alg. coll. Kishinev, (Russian) 1971.

 

4 Lattice isomorphisms of matrix bands of semigroup with cancellation law. 1-th All-union semigroup simp., Sverdlovsk, 1969. (with V. Baranskij, Russian)


3. Semigroups whose proper subsemigroups all are abelian.16-th reg. conf. of pedagogical inst., Kirov, (Russian) 1968.

2. Lattice isomorphisms of bisimple inverse semigroups with unit. 9-th All-union alg. coll. Gomel, 1968. (with V. Baranskij, Russian)

1. Half-isomorphisms and lattice isomorphisms of some classes of semigroups. 8-th All-union alg. coll., Riga, 1967. (with V. Baranskij, Russian)

 

 

CITATION: List of papers citied the above publications

  home