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


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




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

Diskretnaya Matematika, 2000, Volume 12, Issue 4, Pages 99–108
DOI: https://doi.org/10.4213/dm350 (Mi dm350) 		 
On the number of rules needed for an automaton grammar to generate a finite language

N. Yu. Demin
Full-text PDF (742 kB)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm350
Abstract: We consider the problem on reconstructing the data communication protocol, on the base of the message traffic. Formally, this problem is reduced to the problem to synthesise a grammar, given the language which it generates. We give a bound for the number of rules needed for the automaton grammar to generate a language of the given finite cardinality.
Received: 18.11.2000
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: N. Yu. Demin, “On the number of rules needed for an automaton grammar to generate a finite language”, Diskr. Mat., 12:4 (2000), 99–108; Discrete Math. Appl., 10:6 (2000), 587–596
Citation in format AMSBIB
\Bibitem{Dem00}
\by N.~Yu.~Demin
\paper On the number of rules needed for an automaton grammar to generate a finite language
\jour Diskr. Mat.
\yr 2000
\vol 12
\issue 4
\pages 99--108
\mathnet{http://mi.mathnet.ru/dm350}
\crossref{https://doi.org/10.4213/dm350}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1826182}
\zmath{https://zbmath.org/?q=an:1088.68632}
\transl
\jour Discrete Math. Appl.
\yr 2000
\vol 10
\issue 6
\pages 587--596
Linking options:
  • https://www.mathnet.ru/eng/dm350
  • https://doi.org/10.4213/dm350
  • https://www.mathnet.ru/eng/dm/v12/i4/p99
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:500
    Full-text PDF :219
    References:33
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024