Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov POMI, 1998, Volume 248, Pages 205–215 (Mi znsl633)  
On process languages in finite graphs

K. V. Shakhbazyan, Yu. G. Shoukouryan

Institute for Informatics and Automation Problems of National Academy of Science of the Republic of Armenia
Full-text PDF (209 kB)
Abstract: Processes in an arbitrary graph and languages of processes provide descriptions of processes in pipeline systems. The properties of syntactic congruences of process languages are studied. A necessary and sufficient condition for the finiteness of a syntactic congruence is obtained. The set of finite languages of the trace monoid, which corresponds to finite processes in the graph, is considered. The unrecognizability of this set by finite automata is established.
Received: 02.12.1996
English version:
Journal of Mathematical Sciences (New York), 2000, Volume 101, Issue 4, Pages 3348–3354
DOI: https://doi.org/10.1007/BF02672777
Bibliographic databases:
UDC: 519.71
Language: Russian
Citation: K. V. Shakhbazyan, Yu. G. Shoukouryan, “On process languages in finite graphs”, Computational methods and algorithms. Part XIII, Zap. Nauchn. Sem. POMI, 248, POMI, St. Petersburg, 1998, 205–215; J. Math. Sci. (New York), 101:4 (2000), 3348–3354
Citation in format AMSBIB
\Bibitem{ShaSho98}
\by K.~V.~Shakhbazyan, Yu.~G.~Shoukouryan
\paper On process languages in finite graphs
\inbook Computational methods and algorithms. Part~XIII
\serial Zap. Nauchn. Sem. POMI
\yr 1998
\vol 248
\pages 205--215
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl633}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1693225}
\zmath{https://zbmath.org/?q=an:0959.68074}
\transl
\jour J. Math. Sci. (New York)
\yr 2000
\vol 101
\issue 4
\pages 3348--3354
\crossref{https://doi.org/10.1007/BF02672777}
Linking options:
  • https://www.mathnet.ru/eng/znsl633
  • https://www.mathnet.ru/eng/znsl/v248/p205
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:135
    Full-text PDF :61
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024