Journal
UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, UCNC 2019
Volume 11493, Issue -, Pages 108-121Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-030-19311-9_10
Keywords
-
Categories
Funding
- Akademiska personala atjaunotne un kompetencu pilnveide Latvijaspilnveide Latvijas Universitate lig [8.2.2.0/18/A/010 LU, ESS2018/289]
- ERC Advanced Grant MQC
- Vaisala Foundation
- ANR project CoCoGro [ANR-16-CE40-0005]
Ask authors/readers for more resources
We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-valued affine automata is simulated in logarithmic space. Second, we give an impossibility result for algebraic-valued affine automata. As a result, we identify some unary languages (in logarithmic space) that are not recognized by algebraic-valued affine automata with cutpoints.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
