18 citations · 34 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2010★ 18 cited
Parikh Images of Regular Languages: Complexity and Applications
Anthony Widjaja To
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and tot…
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…