Article ID Journal Published Year Pages File Type
4952502 Theoretical Computer Science 2016 23 Pages PDF
Abstract
This paper provides efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results:
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Efficient algorithms for membership in boolean hierarchies of regular languages
Authors
, , ,