Published January 1, 2015
| Version v1
Book chapter
Open
A Circuit Complexity Approach to Transductions
Description
Low circuit complexity classes and regular languages exhibit very tight interactions that shade light on their respective expressiveness. We propose to study these interactions at a functional level, by investigating the deterministic rational transductions computable by constant-depth, polysize circuits. To this end, a circuit framework of independent interest that allows variable output length is introduced. Relying on it, there is a general characterization of the set of transductions realizable by circuits. It is then decidable whether a transduction is definable in \(\mathrm{AC}^0\) and, assuming a well-established conjecture, the same for \(\mathrm{ACC}^0\).
Files
article.pdf
Files
(506.6 kB)
Name | Size | Download all |
---|---|---|
md5:bebc79424e9b49377bedc28fb51b5ff8
|
506.6 kB | Preview Download |