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, 2010, supplement № 3, Pages 92–94 (Mi pdm183)  
Applied Theory of Coding, Automata and Graphs

On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality

I. R. Akishev, M. E. Dvorkin

St. Petersburg State University of Information Technologies, Mechanics and Optics, St. Petersburg
Full-text PDF (371 kB)
References:
PDF
HTML
Abstract: The article considers the problem of constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality over the alphabet $\{0,1\}$. The considered problem is proved to be equivalent to the problem of finding the shortest addition-chain ending with a given number. Several interesting properties of the desired minimal finite automaton are proved, and the identical problem concerning Moore automata is discussed.
Document Type: Article
UDC: 519.713+519.766
Language: Russian
Citation: I. R. Akishev, M. E. Dvorkin, “On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality”, Prikl. Diskr. Mat., 2010, supplement № 3, 92–94
Citation in format AMSBIB
\Bibitem{AkiDvo10}
\by I.~R.~Akishev, M.~E.~Dvorkin
\paper On constructing minimal deterministic finite automaton recognizing a~prefix-code of given cardinality
\jour Prikl. Diskr. Mat.
\yr 2010
\pages 92--94
\issueinfo supplement № 3
\mathnet{http://mi.mathnet.ru/pdm183}
Linking options:
  • https://www.mathnet.ru/eng/pdm183
  • https://www.mathnet.ru/eng/pdm/y2010/i12/p92
    Cycle of papers
    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