7 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.FL2011
Decidability and Shortest Strings in Formal Languages
Levent Alpoge, Thomas Ang, Luke Schaeffer +1
Given a formal language L specified in various ways, we consider the problem of determining if L is nonempty. If L is indeed nonempty, we find upper and lower bounds on the length…
cs.FL2009★ 7 cited
Automata and Reduced Words in the Free Group
Thomas Ang, Giovanni Pighizzini, Narad Rampersad +1
We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoi…
cs.FL2009★ 1 cited
Length of the Shortest Word in the Intersection of Regular Languages
Thomas Ang, Jeffrey Shallit
In this note, we give a construction that provides a tight lower bound of mn-1 for the length of the shortest word in the intersection of two regular languages with state complexit…