Informatics Report Series



Related Pages

Report (by Number) Index
Report (by Date) Index
Author Index
Institute Index

Title:Unary finite automata vs. arithmetic progressions
Authors: Anthony Lin
Date:Dec 2008
Publication Type:Journal Article Publication Status:Submitted
We point out a subtle error in the proof of Chrobak's theorem that every unary NFA can be represented as a union of arithmetic progressions that is at most quadratically large. We propose a correction for this and show how Martinez's polynomial time algorithm, which realizes Chrobak's theorem, can be made correct accordingly. We also show that Martinez's algorithm cannot be improved to have logarithmic space, unless L = NL.
Links To Paper
ArXiv preprint
Bibtex format
author = { Anthony Lin },
title = {Unary finite automata vs. arithmetic progressions},
journal = {},
year = 2008,
month = {Dec},
url = {},

Home : Publications : Report 

Please mail <> with any changes or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh