Language Approximation With One-Counter Automata
Alexander Sakharov
TL;DR
This paper introduces a method to approximate context-free languages using one-counter automata, enabling parse tree reconstruction and identifying a decidable language class recognized by these automata.
Contribution
It presents a novel approach to approximate context-free languages with one-counter automata and characterizes a decidable superset of regular languages recognized by them.
Findings
Enables parse tree reconstruction from approximations.
Identifies a decidable superset of regular languages.
Provides a method for language approximation using one-counter automata.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Formal Methods in Verification · Algorithms and Data Compression