Preview
Unable to display preview. Download preview PDF.
Literatur
Brainerd, W.S.: Tree Generating Regular Systems. Inf. a. Contr. 14 (1969).
Costich, O.L.: A Medvedev Characterisation of Sets Recognized by Generalised Finite Automata. Math. Syst. Th. Vol. 6, No 3 (1972).
Mezei, J. Wright, J.B.: Algebraic Automata and Contextfree Sets. Inf. a. Contr. 11 (1967).
Shepard, C.D.: Languages in General Algebra. Doct. Dissertation, Univ. of Illinois, (1969).
Thatcher, J.W., Wright, J.B. Generalised Finite Automata Theory with an Application to a Decision Problem of Second-order Logic. IBM Research Paper, RC-1713.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Opp, M. (1975). Allgemeine Σ-Grammatiken. In: Mülbacher, J. (eds) GI — 5. Jahrestagung. GI 1975. Lecture Notes in Computer Science, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07410-4_648
Download citation
DOI: https://doi.org/10.1007/3-540-07410-4_648
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07410-6
Online ISBN: 978-3-540-37929-4
eBook Packages: Springer Book Archive