Abstract
Regular languages can be represented by finite automata and by railroad diagrams. These two visual forms can be converted to each other. Context-free languages can also be described by (finite sets of) railroad diagrams. Based on the analogy we develop a new type of automata, the fractal automata: they accept the context-free languages. Relations between pushdown automata and fractal automata are also established.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer (1997)
Wirth, N.: The Programming Language Pascal (July 1973)
Nagy, B.: Programnyelvek elemeinek szintaktikus leÃrása normál formában (Syntactic Description of Programming Languages in a Normal Form, in Hungarian). In: Conference on Informatics in Higher Education 2005, Debrecen, 6+1 pages (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagy, B. (2014). Graphical Representations of Context-Free Languages. In: Dwyer, T., Purchase, H., Delaney, A. (eds) Diagrammatic Representation and Inference. Diagrams 2014. Lecture Notes in Computer Science(), vol 8578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44043-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-44043-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44042-1
Online ISBN: 978-3-662-44043-8
eBook Packages: Computer ScienceComputer Science (R0)