Culik, Karel II; Maurer, H. A. String representations of graphs. (English) Zbl 0399.05046 Int. J. Computer Math., Sect. A 6, 273-301 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 Documents MSC: 05C99 Graph theory Keywords:Formal Languages; Labeled Rooted Ordered Trees; Infinite Graphs; Tree Grammars; Finite Graphs; Algebraic Expressions; Developmental Biology; Algebraic Representation; Tree Automata; Class of Graphs PDF BibTeX XML Cite \textit{K. Culik II} and \textit{H. A. Maurer}, Int. J. Comput. Math. 6, 273--301 (1978; Zbl 0399.05046) Full Text: DOI OpenURL References: [1] Brzozowski, J. 1968. Regular like expressions for some irregularlanguages. 9th IEEE Symposium on Switching and Automata Theory. Oct1968. [2] DOI: 10.1080/03081077608934737 · Zbl 0332.68054 [3] Salomaa, A. 1973. ”Formal Languages”. London, New York: Academic Press. · Zbl 0262.68025 [4] Berztiss A. T., Data Structures (1971) · Zbl 0216.49501 [5] DOI: 10.1093/comjnl/19.4.326 · Zbl 0341.68028 [6] Reeker L. H., Theory of Machines and Computations pp 143– (1971) 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.