Affiliation:
1. CNRS & University Paris Diderot - Paris 7
2. University of Tübingen
Abstract
Complexity theory and the theory of regular languages both belong to the branch of computer science where the use of resources in computing is the main focus. However, they operate at different levels. While complexity theory seeks to classify computational problems by resource use, such as space and time, regular language theory remains at the very base of this hierarchy and is concerned with classes of computational problems for which membership is (potentially) decidable.
Publisher
Association for Computing Machinery (ACM)
Reference38 articles.
1. Free profinite semigroups over semidirect products;Almeida Jorge;Izvestiya VUZ Matematika,1995
2. Profinite categories and semidirect products
3. Regular languages in NC1
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献