arXiv Open Access 2017

Language Approximation With One-Counter Automata

Alexander Sakharov

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL

Penulis (1)

Alexander Sakharov

Format Sitasi

APA MLA BibTeX

Sakharov, A. (2017). Language Approximation With One-Counter Automata. https://arxiv.org/abs/1707.07670

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓