An automata characterisation for multiple context-free languages
Tobias Denkinger
TL;DR
This paper introduces a new automata model called tree stack automata and characterizes the class of multiple context-free languages through a restricted form of these automata.
Contribution
It provides a novel automata-based characterization of multiple context-free languages using tree stack automata.
Findings
Tree stack automata can recognize multiple context-free languages.
A restricted form of tree stack automata exactly characterizes these languages.
The framework offers a new perspective on automata for complex language classes.
Abstract
We introduce tree stack automata as a new class of automata with storage and identify a restricted form of tree stack automata that recognises exactly the multiple context-free languages.
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 · Algorithms and Data Compression · DNA and Biological Computing