Unary finite automata vs. arithmetic progressions

Simple item page
dc.creatorTo, Anthony Widjaja
dc.date2008-12-06
dc.date.accessioned2026-07-07T12:10:03Z
dc.date.available2026-07-07T12:10:03Z
dc.descriptionWe 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.
dc.descriptionJournal paper submitted
dc.identifierhttps://arxiv.org/abs/0812.1291
dc.identifierhttp://arxiv.org/abs/0812.1291
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209827
dc.subjectComputational Complexity
dc.subjectLogic in Computer Science
dc.titleUnary finite automata vs. arithmetic progressions
dc.typetext

Files

Collections

arXiv