Language Approximation With One-Counter Automata
classification
💻 cs.FL
keywords
automatalanguagesone-counterapproximationallowsapproximatingcontext-freedecidable
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.