On Undecidability of Subset Theories of Some Unars
-
Published:2024-04
Issue:2
Volume:109
Page:112-116
-
ISSN:1064-5624
-
Container-title:Doklady Mathematics
-
language:en
-
Short-container-title:Dokl. Math.
Publisher
Pleiades Publishing Ltd
Reference12 articles.
1. A. Mostowski, “On direct products of theories,” J. Symb. Logic 17 (3), 1–31 (1952). https://doi.org/10.1016/S0049-237X(09)70257-5
2. C. Marini, G. Simi, A. Sorbi, and M. Sorrentino, “A note on algebras of languages,” Theor. Comput. Sci. 412, 6531–6536 (2011). https://doi.org/10.1016/j.tcs.2011.08.022
3. A. S. Konovalov and V. L. Selivanov, “Boolean algebras of regular languages,” Algebra Logika 52 (6), 676–711 (2013).
4. S. M. Dudakov, “On undecidability of concatenation theory for one-symbol languages,” Lobachevskii J. Math. 41 (2), 168–175 (2020). https://doi.org/10.1134/S1995080220020055
5. S. Dudakov and B. Karlov, “On decidability of theories of regular languages,” Theory Comput. Syst. 65 (3), 462–478 (2021). https://doi.org/10.1007/s00224-020-09995-4