1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2007
The DFAs of Finitely Different Languages
Andrew Badr, Ian Shipman
Two languages are "finitely different" if their symmetric difference is finite. We consider the DFAs of finitely different regular languages and find major structural similarities.…
math.CO2005★ 1 cited
The distinguishing number of the iterated line graph
Ian Shipman
We show that for all simple graphs G other than the cycles C_3,C_4,C_5, and the claw K_1,3 there exists a K > 0 such that whenever k > K the k-th iterate of the line graph can be d…