1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2008
Unary finite automata vs. arithmetic progressions
Anthony Widjaja To
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…
cs.LO2008★ 1 cited
Logical Queries over Views: Decidability and Expressiveness
James Bailey, Guozhu Dong, Anthony Widjaja To
We study the problem of deciding satisfiability of first order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments o…