|
|
|
|
Список литературы
|
|
| |
| 1. |
Lothaire M., Combinatorics on words. Cambridge mathematical library, Cambridge Univ. Press, Cambridge, 1997   |
| 2. |
Kuske D., “Theories of orders on the set of words”, RAIRO Theor. Inform. Appl., 40 (2006), 53–74  |
| 3. |
Higman G., “Ordering by divisibility in abstract algebras”, Proc. London Math. Soc., 3 (1952), 326–336 |
| 4. |
Kruskal J. B., “The theory of well-quasi-ordering: a frequently discovered concept”, J. Comb. Theory Ser. A, 13 (1972), 297–305 |
| 5. |
Glasser C., Schmitz H., “The Boolean structure of dot-depth one”, J. Autom. Lang. Comb., 6:4 (2001), 437–452 |
| 6. |
Selivanov V. L., “A logical approach to decidability of hierarchies of regular star-free languages”, Proc. of STACS-2001, Lect. Notes Comput. Sci., 2010, Springer-Verl., Berlin, 2001, 539–550 |
| 7. |
Kudinov O. V., Selivanov V. L., “A Gandy theorem for abstract structures and applications to first-order definability”, Proc. of CiE-2009, Lect. Notes Comput. Sci., 5635, Springer-Verl., Berlin, 2009, 290–299 |
| 8. |
Kudinov O. V., Selivanov V. L., “Definability in the infix order on words”, Proc. of DLT-2009, Lect. Notes Comput. Sci., 5583, Springer-Verl., Berlin, 2009, 454–465 |
| 9. |
Nies A., “Definability in the c.e. degrees: questions and results”, Computability theory and its applications, Contemp. Math., 257, Univ. of Colorado, 2000, 207–213 |
| 10. |
Moschovakis Y., Elementary induction on abstract structures, North-Holland, Amsterdam, 1974 |
| 11. |
Barwise J., Admissible sets and structures, Springer-Verl., Berlin, 1975 |
| 12. |
Ершов Ю. Л., Определимость и вычислимость, Научная книга, Новосибирск, 1996 |
| 13. |
Hodges W., Model theory, Cambridge Univ. Press, Cambridge, 1993 |
