On some representations of context-free languages
Formal Languages and Automata Theory
2020-10-13 v1
Abstract
Context-free languages are widely used to describe the syntax of programming languages and natural languages. Usually, we describe a context-free language mathematically with the help of context-free grammar (for generation) or pushdown automata (for recognition). The purpose of this study is to describe some unconventional methods of description of context-free languages, namely a representation with the help of finite digraphs and with automata - generators of context-free languages. We will mainly focus on the mathematical models of these representations.
Cite
@article{arxiv.2010.04823,
title = {On some representations of context-free languages},
author = {Krasimir Yordzhev},
journal= {arXiv preprint arXiv:2010.04823},
year = {2020}
}