Language Approximation With One-Counter Automata
Formal Languages and Automata Theory
2017-07-26 v1
Abstract
We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We identify a decidable superset of regular languages whose elements, i.e. languages, are recognized by one-counter automata.
Cite
@article{arxiv.1707.07670,
title = {Language Approximation With One-Counter Automata},
author = {Alexander Sakharov},
journal= {arXiv preprint arXiv:1707.07670},
year = {2017}
}