Preview
Unable to display preview. Download preview PDF.
References
GRUSKA, J. A characterization of context-free languages. Journal Comput. Syst. Sci. 5 (1971), 353–364.
KLEENE, S. C. Representation of events in nerve-nets and finite automata. Automata Studies, Princeton, 1956, 3–41.
SALOMAA, A. Two complete axiom systems for the algebra of regular events. JACM 13, Nr. 1 (January 1966), 158–169.
MCWHIRTER, J. P. Substitution expressions. Journal Comput. Syst. Sci. 5 (1971), 629–673.
YNTEMA, M. K. Cap expressions for context-free languages. Information and Control 18 (1971), 311–318.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wechsung, G. (1975). The axiomatization problem of a theory of linear languages. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_689
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_689
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive