ALGORITHMIC PROPERTIES OF BASIC CATEGORIAL GRAMMARS WITH UNIQUE CATEGORY ASSIGNMENT
- Autores: Vishnikin M.E1
-
Afiliações:
- Lomonosov Moscow State University
- Edição: Volume 523, Nº 1 (2025)
- Páginas: 21-26
- Seção: MATHEMATICS
- URL: https://ogarev-online.ru/2686-9543/article/view/305340
- DOI: https://doi.org/10.31857/S2686954325030044
- EDN: https://elibrary.ru/JSKCMQ
- ID: 305340
Citar
Resumo
Palavras-chave
Sobre autores
M. Vishnikin
Lomonosov Moscow State University
Email: maksim.vishnikin@math.msu.ru
Moscow, Russia
Bibliografia
- Ajdukiewicz K. Die syntaktische konnexitat // Studia philosophica. 1935. P. 1-27.
- Bar-Hillel Y. A quasi-arithmetical notation for syntactic description // Language. 1953. V. 29. № 1. P. 47-58.
- Bar-Hillel Y., Gaijman H., Shamir E. On categorial and phrase structure grammars // Bulletin of the Research Council of Israel. 1960. 9F. P. 155-166.
- Вишникин М.Е. Базовые категориальные грамматики с однозначным присвоением типов // Вестник Московского университета. Серия 1. Математика. Механика. 2022. № 2. C. 64-67.
- Post E. A variant of a recursively unsolvable problem // Bull. Amer. Math. Soc. 1946. V. 52. № 4. P. 264-269.
- Пентус А.Е., Пентус М.Р. Теория формальных языков: Учебное пособие. Москва: Изд-во ЦПИ при механико-математическом ф-те МГУ. 2004. 80 стр.
- Neary T. Undecidability in binary tag systems and the Post correspondence problem for five pairs of words // Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science. 2015. V. 30. P. 649-661.
- Foret A. The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable // Electronic Notes in Theoretical Computer Science. 2004. V. 53. P. 81-93.
- Kanazawa M. Identification in the limit of categorial grammars // Journal of Logic, Language and Information. 1996. V. 5. P. 115-155.
Arquivos suplementares
