Article ID Journal Published Year Pages File Type
6875417 Theoretical Computer Science 2018 12 Pages PDF
Abstract
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties:
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Variations of checking stack automata: Obtaining unexpected decidability properties
Authors
, ,