?
Теоретические основы, используемые для построения инструментов анализа языков программирования на примере языка Perl
С. 281–283.
Вендин А. С.
In this work are considered a theoretical basis, which can help approach the implementation of the tool for analyze the source code of the program in Perl.
In book
Чебоксары: Общество с ограниченной ответственностью "Центр научного сотрудничества "Интерактив плюс", 2017.
Dudakov S., Карлов Б. Н., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 524 № 1 С. 11–18
In this paper we study the problem of total derivability in context-free, noncontracting, and context-sensitive grammars. Given a grammar and a terminal word, one has to determine whether there exists a derivation of this word which uses each production no less than a given number of times. It is proved that the problem of total ...
Added: March 18, 2026
П.Е. Белова, А.К. Сафарян, В кн.: Научно-практическая конференция с международным участием "Национальные и международные тенденции и перспективы развития судебной экспертизы". Сборник докладов.: Н. Новгород: Изд-во ННГУ им. Н.И. Лобачевского, 2024.
В данной статье представлено описание системы автоматического поиска и извлечения побуждений из текстов на русском языке FindImper, основанной на поиске глагольных форм и синтаксических связей. Алгоритм реализован на языке программирования Python с использованием библиотек для морфологического и синтаксического анализа и набора правил. Данный инструмент направлен на оптимизацию работы эксперта-лингвиста и доступен к использованию через веб-сайт ...
Added: January 30, 2026
A. D. Dzheiranian, Ermakov I. D., Proskuryakov K. A. et al., Proceedings of the Institute for System Programming of the RAS 2024 Vol. 36 No. 2 P. 127–140
The data visualization method based on a language-oriented approach is proposed. An analysis of data visualization tools and their customizability for subject areas based on user needs has been carried out. It is noted that these tools require highly qualified users to customize the data visualization format (users must have programming skills). It is proposed ...
Added: July 29, 2024
Salibekyan S. M., Информационные технологии 2024 Т. 30 № 5 С. 261–268
The article is devoted to the description of the developed method and tools for translating high-level programming languages into an abstract syntactic tree. The peculiarity of the technique is that it is based on the object-attribute (OA) architecture of a computing system belonging to the dataflow class. The syntactic tree synthesized by the translator is ...
Added: May 21, 2024
Sergey Dudakov, Karlov B., Theory of Computing Systems 2021 Vol. 65 No. 3 P. 462–478
This paper is dedicated to studying decidability properties of theories of regular languages with classical operations: union, concatenation, and the Kleene star. The theory with union only is a theory of some Boolean algebra, so it is decidable. We prove that the theory of regular languages with the Kleene star only is decidable. If we ...
Added: November 12, 2023
S. M. Dudakov, Karlov B. N., S. L. Kuznetsov et al., Algebra and Logic 2021 Vol. 60 No. 5 P. 308–326
The Lambek calculus with the unit can be defined as the atomic theory (algebraic logic) of the class of residuated monoids. This calculus, being a theory of a broader class of algebras than Heyting ones, is weaker than intuitionistic logic. Namely, it lacks structural rules: permutation, contraction, and weakening. We consider two extensions of the ...
Added: November 12, 2023
Zakharov V., Automatic Control and Computer Sciences (AC&CS), Switzerland 2021 Vol. 55 No. 7 P. 670–701
Finite transducers, two-tape automata, and biautomata are related computational models
descended from the concept of finite-state automaton. In these models an automaton controls two
heads that read or write symbols on the tapes in the one-way mode. The computations of these three
types of automata show many common features, and it is surprising that the methods for analyzing ...
Added: January 17, 2022
Govindaraj R., Mahendran A., International Journal of Reasoning-based Intelligent Systems 2018 Vol. 3 No. 4 P. 197–203
A picture grammar is the generation of pictures through description of words. The picture is represented in matrix form of finite alphabet using various grammars. Picture grammar can be achieved through context free grammar or regular expressions. Here we extend hexagonal picture language to octagonal picture language thereby introducing octagonal Wang system (OWS) and octagonal ...
Added: November 24, 2021
Гельцер Б. И., Горбач Т. А., Грибова В. В. et al., Труды Института системного программирования РАН 2021 Т. 33 № 4 С. 99–116
The paper compares three methods for parsing of patients’ chief complaints extracted from electronic medical cards. We propose two methods which are based on usage of an ontology: either as a method for correction of mistake made by a parser, or for constructing syntactical dependencies according to this ontology and a limited set of rules ...
Added: October 20, 2021
Switzerland: Springer International Publishing, 2021.
Added: September 28, 2021
Cham: Springer, 2020.
This Festschrift is in honor of Prof. Andre Scedrov at the University of Pennsylvania. Scedrov has laid the foundations for a number of now well-established domains in mathematics and computer science including Proof Theory, Logic in Computer Science, Foundations in Computer Security, and Linguistics.
This combination of breadth and penetrating originality is rare and impressive. This ...
Added: November 25, 2020
Knutov A., Plaksin S., Grigorieva N. et al., М.: Издательский дом НИУ ВШЭ, 2020.
В настоящей публикации описан опыт оценки удобочитаемости законодательных актов Российской Федерации на основе их синтаксического анализа методами компьютерной лингвистики. Для этого разработана методология машинного анализа синтаксической сложности с построением интегрального индекса. Впервые получены всеобъемлющие статистические данные о синтаксисе федерального законодательства. Авторы пришли к выводу, что законодательство с 1991 года стало сложнее на 30%. Также в ...
Added: May 25, 2020
Klyshinskiy E., Karpik O., Mathematica Montisnigri 2019 Vol. XLVI P. 123–132
Machine learning systems are facing problem of incomparability of their results in case of different languages; one of the subarea here is quantitative analysis of syntax. In this paper, we introduce a new quantitative method based on statistics of words co-occurrence in syntactically tagged corpora. The method allows quantitatively evaluate difference and similarity among languages, ...
Added: October 26, 2019
Grigorev S., Bozhko S., Хатбуллина Л. Р., Lecture Notes in Computer Science 2019 Vol. 11541 P. 264–281
Formal language theory has a deep connection with such areas as static code analysis, graph database querying, formal verifica- tion, and compressed data processing. Many application problems can be formulated in terms of languages intersection. The Bar-Hillel theo- rem states that context-free languages are closed under intersection with a regular set. This theorem has a ...
Added: August 20, 2019
Rubtsov A. A., , in: Developments in Language Theory 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings.: Cham: Springer, 2018. P. 553–565.
We present a new structural lemma for deterministic con- text free languages. From the first sight, it looks like a pumping lemma, because it is also based on iteration properties, but it has significant distinctions that makes it much easier to apply. The structural lemma is a combinatorial analogue of KC-DCF-Lemma (based on Kolmogorov complexity), ...
Added: September 12, 2018
Cham: Springer, 2018.
This volume of Lecture Notes in Computer Science contains the papers presented at the 22nd International Conference on Developments in Language Theory (DLT 2018) organized by the Algorithmic “Oritatami” Self-Assembly Laboratory as part of the 100th Anniversary Commemorative Events of University of Electro-Communications (UEC) in Fuchu, Tokyo, Japan, during September 10–14, 2018.
The DLT conference series is one ...
Added: September 12, 2018
Michigan Slavic Publications, 2020.
Added: April 19, 2018
Ismagilov R. S., Мастихина А. А., Filippova L., Вестник Московского государственного технического университета им. Н.Э. Баумана. Серия Естественные науки 2017 № 4 С. 4–15
Рассмотрена задача подсчета числа слов регуляного языка заданного состава. Задан алфавит символов. Состав слова определен как вектор. Введены функции числа слов заданного состава. Определены простые оценки указанных функций для языков, полученных из языков с помощью обычных операций (объединение, конкатенация, итерация). Изучены ряды для языков, порожденных автоматами. ...
Added: March 9, 2018