Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2020, Issue 4, Pages 5–13
DOI: https://doi.org/10.26456/vtpmk601 (Mi vtpmk601) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Theoretical Foundations of Computer Science

On definability of one-symbol languages in the monoid of finite languages with concatenation

S. M. Dudakov

Tver State University, Tver
Full-text PDF (338 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.26456/vtpmk601
Abstract: We consider an algebra of all finite languages with the concatenation operation. For one-symbol languages it is known that its theory is equivalent to the first-order arithmetic. Earlier it was proved that for regular languages a one-symbol algebra can be interpreted in multi-symbol algebras. Here we show how to define a one-symbol subalgebra in multi-symbol algebras for finite languages.
Keywords: language, finite language, concatenation, first-order arithmetic.
Funding agency Grant number
Russian Foundation for Basic Research 20-01-00435-а
Received: 08.10.2020
Revised: 20.10.2020
Bibliographic databases:
Document Type: Article
UDC: 510.665, 519.765
Language: Russian
Citation: S. M. Dudakov, “On definability of one-symbol languages in the monoid of finite languages with concatenation”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2020, no. 4, 5–13
Citation in format AMSBIB
\Bibitem{Dud20}
\by S.~M.~Dudakov
\paper On definability of one-symbol languages in the monoid of finite languages with concatenation
\jour Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]
\yr 2020
\issue 4
\pages 5--13
\mathnet{http://mi.mathnet.ru/vtpmk601}
\crossref{https://doi.org/10.26456/vtpmk601}
\elib{https://elibrary.ru/item.asp?id=44503256}
Linking options:
  • https://www.mathnet.ru/eng/vtpmk601
  • https://www.mathnet.ru/eng/vtpmk/y2020/i4/p5
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
    Statistics & downloads:
    Abstract page:206
    Full-text PDF :133
    References:20
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024