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


Model. Anal. Inform. Sist., 2010, Volume 17, Number 2, Pages 48–71 (Mi mais4)  

On languages of automaton counter machines

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

P. G. Demidov Yaroslavl State University

Abstract: Some properties of formal languages (ACML) of automaton counter machines are investigated. We show that a class of these languages is closed with respect to the following operations: union, intersection by regular sets, concatenation, infinite iteration (Kleene star), homomorphism and inverse homomorphism. This means that the ACML-class is full-AFL (Abstract Family of Languages). Moreover, the class of ACML is closed with respect to intersection and substitution, but not closed with respect to conversion and complementation. We prove that an empty language problem and a word recognition problem are decidable for automaton counter machines, but inclusion and equivalence problems are not decidable. We compare the class of ACML with other formal language classes — regular, context-free, context-sensitive and Petri net languages.

Keywords: abstract counter machines, automaton counter machine, Communicating Colouring Automata, formal languages.

Full text: PDF file (632 kB)
References: PDF file   HTML file
UDC: 519.7
Received: 02.03.2010

Citation: E. V. Kuz'min, D. Yu. Chalyi, “On languages of automaton counter machines”, Model. Anal. Inform. Sist., 17:2 (2010), 48–71

Citation in format AMSBIB
\Bibitem{KuzCha10}
\by E.~V.~Kuz'min, D.~Yu.~Chalyi
\paper On languages of automaton counter machines
\jour Model. Anal. Inform. Sist.
\yr 2010
\vol 17
\issue 2
\pages 48--71
\mathnet{http://mi.mathnet.ru/mais4}


Linking options:
  • http://mi.mathnet.ru/eng/mais4
  • http://mi.mathnet.ru/eng/mais/v17/i2/p48

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Моделирование и анализ информационных систем
    Number of views:
    This page:204
    Full text:57
    References:28

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020