3 citations · 4 across the 5 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.FL2010★ 1 cited
A Note on Ordinal DFAs
Stephen L. Bloom, YiDi Zhang
We prove the following theorem. Suppose that is a trim DFA on the Boolean alphabet . The language is well-ordered by the lexicographic order $\slex$ iff whenever th…
cs.FL2010
Algebraic Linear Orderings
Stephen L. Bloom, Zoltan Esik
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped…