Complexity classes with finite acceptance types
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4041255
- Classes of bounded counting type and their inclusion relations
- scientific article; zbMATH DE number 512853
- Complexity theory made easy. The formal language approach to the definition of complexity classes
- Unambiguous computations and locally definable acceptance types
Cited in
(8)- Nondeterministic NC^1 computation
- Computational Complexity Via Finite Types
- scientific article; zbMATH DE number 4041255 (Why is no real title available?)
- scientific article; zbMATH DE number 512853 (Why is no real title available?)
- Classes of bounded counting type and their inclusion relations
- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria
- On the acceptance power of regular languages
- Helping by unambiguous computation and probabilistic computation
This page was built for publication: Complexity classes with finite acceptance types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942644)