Stephen L. Bloom

Stephen L. Bloom, YiDi Zhang: A Note on Ordinal DFAs. Order 30(1): 151-164 (2013)

Stephen L. Bloom, Zoltán Ésik: Algebraic Linear Orderings. Int. J. Found. Comput. Sci. 22(2): 491-515 (2011)

Stephen L. Bloom, Zoltán Ésik: Algebraic Ordinals. Fundam. Inform. 99(4): 383-407 (2010)

Stephen L. Bloom, Zoltán Ésik: A Mezei-Wright theorem for categorical algebras. Theor. Comput. Sci. 411(2): 341-359 (2010)

Stephen L. Bloom, Zoltán Ésik: Algebraic Linear Orderings. CoRR abs/1002.1624 (2010)

Stephen L. Bloom, YiDi Zhang: A Note on Ordinal DFAs. CoRR abs/1005.2329 (2010)

Stephen L. Bloom, Zoltán Ésik: Axiomatizing rational power series over natural numbers. Inf. Comput. 207(7): 793-811 (2009)

Stephen L. Bloom, Zoltán Ésik, Werner Kuich: Cycle-Free Finite Automata in Partial Iterative Semirings. CAI 2009: 1-12

Stephen L. Bloom, Zoltán Ésik: Algebraic Ordinals. CoRR abs/0907.0877 (2009)

Stephen L. Bloom, Zoltán Ésik, Werner Kuich: Partial Conway and Iteration Semirings. Fundam. Inform. 86(1-2): 19-40 (2008)

Jirí Adámek, Stephen L. Bloom, Stefan Milius: On Algebras with Iteration. J. Log. Comput. 18(6): 1047-1085 (2008)

Stephen L. Bloom, Zoltán Ésik: Regular and Algebraic Words and Ordinals. CALCO 2007: 1-15

Stephen L. Bloom, Zoltán Ésik: Axiomatizing rational power series. CoRR abs/0712.1337 (2007)

Stephen L. Bloom, Zoltán Ésik, Werner Kuich: Partial Conway and iteration semirings. CoRR abs/0712.2952 (2007)

Stephen L. Bloom, Zoltán Ésik: Completing Categorical Algebras. IFIP TCS 2006: 231-249

Stephen L. Bloom, Zoltán Ésik: The equational theory of regular words. Inf. Comput. 197(1-2): 55-89 (2005)

Stephen L. Bloom, Zoltán Ésik: Axiomatizing omega and omega-op powers of words. ITA 38(1): 3-17 (2004)

Stephen L. Bloom, Zoltán Ésik: Deciding whether the frontier of a regular tree is scattered. Fundam. Inform. 55(1): 1-21 (2003)

Stephen L. Bloom, Zoltán Ésik: An Extension Theorem with an Application to Formal Tree Series. Journal of Automata, Languages and Combinatorics 8(2): 145-185 (2003)

Stephen L. Bloom, Zoltán Ésik: Axioms for Regular Words: Extended Abstract. FSTTCS 2003: 50-61

Stephen L. Bloom, Zoltán Ésik: Unique, guarded fixed points in an additive setting: Extended Abstract. Electr. Notes Theor. Comput. Sci. 69: 47-61 (2002)

Stephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes: Iteration 2-theories. Applied Categorical Structures 9(2): 173-216 (2001)

Stephen L. Bloom, Christian Choffrut: Long words: the theory of concatenation and omega-power. Theor. Comput. Sci. 259(1-2): 533-548 (2001)

Stephen L. Bloom, Zoltán Ésik: Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN 2000: 367-376

Stephen L. Bloom, Zoltán Ésik: Axiomatizing Shuffle and Concatenation in Languages. Inf. Comput. 139(1): 62-91 (1997)

Stephen L. Bloom, Zoltán Ésik: Varieties Generated by Languages with Poset Operations. Mathematical Structures in Computer Science 7(6): 701-713 (1997)

Stephen L. Bloom, Zoltán Ésik: The Equational Logic of Fixed Points (Tutorial). Theor. Comput. Sci. 179(1-2): 1-60 (1997)

Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes: Iteration 2-Theories: Extended Abstract. AMAST 1997: 30-44

Stephen L. Bloom, Nicoletta Sabadini, Robert F. C. Walters: Matrices, machines and behaviors. Applied Categorical Structures 4(4): 343-360 (1996)

Stephen L. Bloom, Zoltán Ésik: Two Axiomatizations of a Star Semiring Quasi-Variety. Bulletin of the EATCS 59 (1996)

Stephen L. Bloom, Zoltán Ésik: Fixed-Point Operations on ccc's. Part I. Theor. Comput. Sci. 155(1): 1-38 (1996)

Stephen L. Bloom, Zoltán Ésik: Free Shuffle Algebras in Language Varieties. Theor. Comput. Sci. 163(1&2): 55-98 (1996)

Stephen L. Bloom, Zoltán Ésik: Some Equational Laws of Initiality in 2CCC's. Int. J. Found. Comput. Sci. 6(2): 95-118 (1995)

Stephen L. Bloom, Zoltán Ésik: Free Shuffle Algebras in Language Varieties (Extended Abstract). LATIN 1995: 99-111

Stephen L. Bloom, Zoltán Ésik: Nonfinite Axiomatizability of Shuffle Inequalities. TAPSOFT 1995: 318-333

Stephen L. Bloom, Zoltán Ésik: Solving Polynomial Fixed Point Equations. MFCS 1994: 52-67

Stephen L. Bloom, Zoltán Ésik, Dirk Taubner: Iteration Theories of Synchronization Trees. Inf. Comput. 102(1): 1-55 (1993)

Stephen L. Bloom, Zoltán Ésik: Erratum: Iteration Algebras. Int. J. Found. Comput. Sci. 4(1): 99 (1993)

Stephen L. Bloom, Zoltán Ésik: Matrix and Matricial Iteration Theories, Part I. J. Comput. Syst. Sci. 46(3): 381-408 (1993)

Stephen L. Bloom, Zoltán Ésik: Matrix and Matricial Iteration Theories, Part II. J. Comput. Syst. Sci. 46(3): 409-439 (1993)

Stephen L. Bloom, Zoltán Ésik: Equational Axioms for Regular Sets. Mathematical Structures in Computer Science 3(1): 1-24 (1993)

Stephen L. Bloom, Zoltán Ésik: Some Quasi-Varieties of Iteration Theories. MFPS 1993: 378-409

Stephen L. Bloom, Zoltán Ésik: Iteration Algebras. Int. J. Found. Comput. Sci. 3(3): 245-302 (1992)

Stephen L. Bloom, Zoltán Ésik: Cayley iff Stone. Bulletin of the EATCS 43: 159-161 (1991)

Stephen L. Bloom, Zoltán Ésik: Floyd-Hoare Logic in Iteration Theories. J. ACM 38(4): 887-934 (1991)

Stephen L. Bloom, Zoltán Ésik: Program Correctness and Matricial Iteration Theories. MFPS 1991: 457-476

Stephen L. Bloom, Zoltán Ésik: Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 1991: 264-274

Stephen L. Bloom: A Note on Guarded Theories. Theor. Comput. Sci. 70(1): 73-83 (1990)

Stephen L. Bloom, Zoltán Ésik: Equational Logic of Circular Data Type Specification. Theor. Comput. Sci. 63(3): 303-331 (1989)

Stephen L. Bloom: The Equational Logic of Iterative Processes. FCT 1989: 47-57

Stephen L. Bloom, Klaus Sutner: Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. TAPSOFT, Vol.1 1989: 134-148

Stephen L. Bloom, Zoltán Ésik: Varieties of Iteration Theories. SIAM J. Comput. 17(5): 939-966 (1988)

Stephen L. Bloom, Ralph Tindell: A note on zero-congruences. Acta Cybern. 8: 1-4 (1987)

Stephen L. Bloom: The alternation number and a dot hierarchy of regular sets. Acta Cybern. 7(4): 355-358 (1986)

Stephen L. Bloom: Frontiers of one-letter languages. Acta Cybern. 7(1): 1-18 (1985)

Stephen L. Bloom, Zoltán Ésik: Axiomatizing Schemes and Their Behaviors. J. Comput. Syst. Sci. 31(3): 375-393 (1985)

Stephen L. Bloom, Douglas R. Troeger: A Logical Characterization of Observation Equivalence. Theor. Comput. Sci. 35: 43-53 (1985)

Stephen L. Bloom, Zoltán Ésik: Some varieties of iteration theories. Bulletin of the EATCS 24: 53-65 (1984)

Stephen L. Bloom, James W. Thatcher, Eric G. Wagner, Jesse B. Wright: Recursion and Iteration in Continuous Theories: The "M-Construction". J. Comput. Syst. Sci. 27(2): 148-164 (1983)

Stephen L. Bloom: All Solutions of a System of Recursion Equations in Infinite Trees and Other Contraction Theories. J. Comput. Syst. Sci. 27(2): 225-255 (1983)

Stephen L. Bloom, Ralph Tindell: Varieties of "if-then-else". SIAM J. Comput. 12(4): 677-707 (1983)

Calvin C. Elgot, Stephen L. Bloom: Selected papers. Springer 1982, isbn 978-3-540-90698-8, pp. I-XXIV, 1-460

Stephen L. Bloom, David B. Patterson: Easy Solutions are Hard To Find. CAAP 1981: 135-146

Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright: Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation. SIAM J. Comput. 9(1): 25-45 (1980)

Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright: Vector Iteration in Pointed Iterative Theories. SIAM J. Comput. 9(3): 525-540 (1980)

Stephen L. Bloom, Ralph Tindell: Compatible Orderings on the Metric Theory of Trees. SIAM J. Comput. 9(4): 683-691 (1980)

Stephen L. Bloom, Ralph Tindell: Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. Theor. Comput. Sci. 9: 265-286 (1979)

Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell: On the Algebraic Atructure of Rooted Trees. J. Comput. Syst. Sci. 16(3): 362-399 (1978)

Stephen L. Bloom, Susanna Ginali, Joseph D. Rutledge: Scalar and Vector Iteration. J. Comput. Syst. Sci. 14(2): 251-256 (1977)

Stephen L. Bloom, Calvin C. Elgot: The Existence and Construction of Free Iterative Theories. J. Comput. Syst. Sci. 12(3): 305-318 (1976)

Stephen L. Bloom: Varieties of Ordered Algebras. J. Comput. Syst. Sci. 13(2): 200-212 (1976)