Modelirovanie i Analiz Informatsionnykh Sistem
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


Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find




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

Modelirovanie i Analiz Informatsionnykh Sistem, 2009, Volume 16, Number 3, Pages 77–84 (Mi mais65)  
This article is cited in 1 scientific paper (total in 1 paper)

On a reachability set of automaton 3-counter machines

E. V. Kuz'min, D. Yu. Chalyi

P. G. Demidov Yaroslavl State University
Full-text PDF (263 kB) Citations (1)
References:
PDF
HTML
Abstract: In this paper we prove the existence of automaton 3-counter machines which have non-semilinear reachability sets.
Keywords: abstract counter machines, automaton counter machine, Communicating Colouring Automata, reachability sets, semilinear sets.
Received: 28.06.2009
Document Type: Article
UDC: 519.7
Language: Russian
Citation: E. V. Kuz'min, D. Yu. Chalyi, “On a reachability set of automaton 3-counter machines”, Model. Anal. Inform. Sist., 16:3 (2009), 77–84
Citation in format AMSBIB
\Bibitem{KuzCha09}
\by E.~V.~Kuz'min, D.~Yu.~Chalyi
\paper On a reachability set of automaton 3-counter machines
\jour Model. Anal. Inform. Sist.
\yr 2009
\vol 16
\issue 3
\pages 77--84
\mathnet{http://mi.mathnet.ru/mais65}
Linking options:
  • https://www.mathnet.ru/eng/mais65
  • https://www.mathnet.ru/eng/mais/v16/i3/p77
    • 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
    		Моделирование и анализ информационных систем
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024