Graphical Representations of Context-Free Languages

Simple item page
dc.contributor.authorNagy, Benedek
dc.date.accessioned2026-02-06T18:28:34Z
dc.date.issued2014
dc.departmentDoğu Akdeniz Üniversitesi
dc.description8th International Conference on the Theory and Application of Diagrams (Diagrams) -- JUL 28-AUG 01, 2014 -- Melbourne, AUSTRALIA
dc.description.abstractRegular 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.
dc.description.sponsorshipMonash Immers Analyt Project
dc.identifier.endpage50
dc.identifier.isbn978-3-662-44043-8
dc.identifier.isbn978-3-662-44042-1
dc.identifier.issn0302-9743
dc.identifier.scopus2-s2.0-84905844104
dc.identifier.scopusqualityQ3
dc.identifier.startpage48
dc.identifier.urihttps://hdl.handle.net/11129/10983
dc.identifier.volume8578
dc.identifier.wosWOS:000343887900007
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer-Verlag Berlin
dc.relation.ispartofDiagrammatic Representation and Inference, Diagrams 2014
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectfractal automata
dc.subjectsyntax diagrams
dc.subjectpushdown automata
dc.titleGraphical Representations of Context-Free Languages
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu