Algebra i Logika. Seminar
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


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




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

Algebra i Logika. Seminar, 1965, Volume 4, Number 4, Pages 53–63 (Mi al1031)  
The algorithmic undecidability of inherent ambiguity of context-free languages

A. V. Gladkii
Full-text PDF (546 kB)
Received: 09.06.1965
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. V. Gladkii, “The algorithmic undecidability of inherent ambiguity of context-free languages”, Algebra i Logika. Sem., 4:4 (1965), 53–63
Citation in format AMSBIB
\Bibitem{Gla65}
\by A.~V.~Gladkii
\paper The algorithmic undecidability of inherent ambiguity of
context-free languages
\jour Algebra i Logika. Sem.
\yr 1965
\vol 4
\issue 4
\pages 53--63
\mathnet{http://mi.mathnet.ru/al1031}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0202507}
Linking options:
  • https://www.mathnet.ru/eng/al1031
  • https://www.mathnet.ru/eng/al/v4/i4/p53
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:54
    Full-text PDF :24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024