×

zbMATH — the first resource for mathematics

The Markov algorithm as a language parser-linear bounds. (English) Zbl 0247.68030

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Mendelson, E., ()
[2] Galler, B.A.; Perlis, A.J., ()
[3] Caracciolo Di Forino, A., String processing languages and generalized Markov algorithm, () · Zbl 0184.39703
[4] Bell, J.R., The design of a minimal expandable computer language, ()
[5] Milgrom, E., Design of an extensible programming language, ()
[6] Hopcroft, J.E.; Ullman, J.D., ()
[7] Seshu, S.; Reed, M.B., ()
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.