Prikladnaya Diskretnaya Matematika
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


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2011, Number 2(12), Pages 73–76 (Mi pdm278)  
This article is cited in 1 scientific paper (total in 1 paper)

Applied Automata Theory

Skeleton automata

V. N. Salii

Saratov State University named after N. G. Chernyshevsky, Saratov, Russia
Full-text PDF (466 kB) Citations (1)
References:
PDF
HTML
Abstract: A skeleton automaton is an automaton in which the relation of mutual accessibility of states is the identity relation. We prove that automata that admit a regular enumeration of states are exactly skeleton automata. It is shown how for a given automaton one can construct an automaton with minimal number of states that has the same subautomata lattice, and is necessarily a skeleton automaton. A procedure is proposed to obtain a skeleton automaton from a given automaton by removal of minimal number of arcs in its transition diagram.
Keywords: automaton, strongly connected automaton, skeleton automaton, regular enumeration of states, subautomata lattice.
Document Type: Article
UDC: 512.5
Language: Russian
Citation: V. N. Salii, “Skeleton automata”, Prikl. Diskr. Mat., 2011, no. 2(12), 73–76
Citation in format AMSBIB
\Bibitem{Sal11}
\by V.~N.~Salii
\paper Skeleton automata
\jour Prikl. Diskr. Mat.
\yr 2011
\issue 2(12)
\pages 73--76
\mathnet{http://mi.mathnet.ru/pdm278}
Linking options:
  • https://www.mathnet.ru/eng/pdm278
  • https://www.mathnet.ru/eng/pdm/y2011/i2/p73
    • 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
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:308
    Full-text PDF :72
    References:40
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024