3 citations · 4 across the 5 of their papers we have counts for
5 papers
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…
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…
Algebraic Ordinals
S. L. Bloom, Z. Esik
An algebraic tree T is one determined by a finite system of fixed point equations. The frontier \Fr(T) of an algebraic tree t is linearly ordered by the lexicographic order \lex. W…
Partial Conway and iteration semirings
S. L. Bloom, Z. Esik, W. Kuich
A Conway semiring is a semiring equipped with a unary operation , always called 'star', satisfying the sum star and product star identities. It is known that these…
Axiomatizing rational power series
S. L. Bloom, Z. Esik
Iteration semirings are Conway semirings satisfying Conway's group identities. We show that the semirings $\N^{\rat}\llangle Σ^* \rrangle$ of rational power series with coefficient…