Strict deterministic grammars. (English) Zbl 0261.68036


68Q45 Formal languages and automata
Full Text: DOI


[1] Dikovskii, A. Ja., On the relationship between the class of all context-free languages and the class of deterministic context-free languages, (Russian), Algebra i Logika, 8, 44-64 (1969)
[2] Ginsburg, S., (The Mathematical Theory of Context-Free Languages (1966), McGraw-Hill: McGraw-Hill New York) · Zbl 0184.28401
[3] Ginsburg, S.; Greibach, S. A., Deterministic context-free languages, Information and Control, 9, 602-648 (1966) · Zbl 0145.00802
[4] Greibach, S. A., An infinite hierarchy of context-free languages, J. Assoc. Comput. Mach., 16, 91-106 (1969) · Zbl 0182.02002
[5] Greibach, S. A., Characteristic and ultrarealtime languages, Information and Control, 18, 65-98 (1971) · Zbl 0216.23803
[6] Gries, D., (Compiler Construction for Digital Computers (1971), John Wiley and Sons: John Wiley and Sons New York) · Zbl 0302.68011
[7] Haines, L. H., Generation and Recognition of Formal Languages, (Ph.D. thesis (1965), M.I.T.) · Zbl 0155.12903
[8] Harrison, M. A., On the relation between grammars and automata, (Tou, J. T., Advances of Information Sciences 4 (1972), Plenum Press: Plenum Press New York), 39-92
[10] Harrison, M. A.; Havel, I. M., Real time strict deterministic languages, SIAM J. Computing (1973), to appear · Zbl 0267.68034
[11] Hopcroft, J. E.; Ullman, J. D., (Formal Languages and Their Relation to Automata (1969), Addison-Wesley: Addison-Wesley Reading, MA) · Zbl 0196.01701
[12] Knuth, D. E., On the translation of languages from left to right, Information and Control, 8, 607-639 (1965) · Zbl 0231.68027
[13] Salomaa, A., (Theory of Automata (1969), Pergamon Press: Pergamon Press New York) · Zbl 0193.32901
[14] Ullman, J. D., Applications of Language Theory to Compiler Design, (A. V., Aho, Technical Report No. 95 Princeton University (1972), Prentice Hall), to appear in “Theoretical Computer Science” · Zbl 0189.19103
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.