Graphical Representations of Context-Free Languages
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer-Verlag Berlin
Access Rights
info:eu-repo/semantics/closedAccess
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.
Description
8th International Conference on the Theory and Application of Diagrams (Diagrams) -- JUL 28-AUG 01, 2014 -- Melbourne, AUSTRALIA
Keywords
fractal automata, syntax diagrams, pushdown automata
Journal or Series
Diagrammatic Representation and Inference, Diagrams 2014
WoS Q Value
Scopus Q Value
Volume
8578
