Stephen L. Bloom

Publication Activity (10 Years)

Years Active: 1968-2013
Publications (10 Years): 0

Top Topics

Multiresolution

Qualitative Decision Theory

Multi Agent Systems

Top Venues

Publications

Stephen L. Bloom, YiDi Zhang
A Note on Ordinal DFAs. Order 30 (1) (2013)
Stephen L. Bloom, Zoltán Ésik
Algebraic Linear Orderings. Int. J. Found. Comput. Sci. 22 (2) (2011)
Stephen L. Bloom, Zoltán Ésik
Algebraic Ordinals. Fundam. Informaticae 99 (4) (2010)
Stephen L. Bloom, YiDi Zhang
A Note on Ordinal DFAs CoRR (2010)
Stephen L. Bloom, Zoltán Ésik
Algebraic Linear Orderings CoRR (2010)
Stephen L. Bloom, Zoltán Ésik
A Mezei-Wright theorem for categorical algebras. Theor. Comput. Sci. 411 (2) (2010)
Stephen L. Bloom, Zoltán Ésik
Algebraic Ordinals CoRR (2009)
Stephen L. Bloom, Zoltán Ésik
Scattered Algebraic Linear Orderings. FICS (2009)
Stephen L. Bloom, Zoltán Ésik, Werner Kuich
Cycle-Free Finite Automata in Partial Iterative Semirings. CAI (2009)
Stephen L. Bloom, Zoltán Ésik
Axiomatizing rational power series over natural numbers. Inf. Comput. 207 (7) (2009)
Jirí Adámek, Stephen L. Bloom, Stefan Milius
On Algebras with Iteration. J. Log. Comput. 18 (6) (2008)
Stephen L. Bloom, Zoltán Ésik, Werner Kuich
Partial Conway and Iteration Semirings. Fundam. Informaticae 86 (1-2) (2008)
Stephen L. Bloom, Zoltán Ésik
Regular and Algebraic Words and Ordinals. CALCO (2007)
Stephen L. Bloom, Zoltán Ésik
Axiomatizing rational power series CoRR (2007)
Stephen L. Bloom, Zoltán Ésik, Werner Kuich
Partial Conway and iteration semirings CoRR (2007)
Stephen L. Bloom, Zoltán Ésik
Completing Categorical Algebras. IFIP TCS (2006)
Stephen L. Bloom, Zoltán Ésik
The equational theory of regular words. Inf. Comput. 197 (1-2) (2005)
Stephen L. Bloom, Zoltán Ésik
Axiomatizing omega and omega-op powers of words. RAIRO Theor. Informatics Appl. 38 (1) (2004)
Stephen L. Bloom, Zoltán Ésik
Axioms for Regular Words: Extended Abstract. FSTTCS (2003)
Stephen L. Bloom, Zoltán Ésik
Deciding whether the frontier of a regular tree is scattered. Fundam. Informaticae 55 (1) (2003)
Stephen L. Bloom, Zoltán Ésik
An Extension Theorem with an Application to Formal Tree Series. J. Autom. Lang. Comb. 8 (2) (2003)
Stephen L. Bloom, Zoltán Ésik
Unique, guarded fixed points in an additive setting: Extended Abstract. CTCS (2002)
Stephen L. Bloom, Christian Choffrut
Long words: the theory of concatenation and omega-power. Theor. Comput. Sci. 259 (1-2) (2001)
Stephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes
Iteration 2-theories. Appl. Categorical Struct. 9 (2) (2001)
Stephen L. Bloom, Zoltán Ésik
Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN (2000)
Stephen L. Bloom, Zoltán Ésik
Shuffle binoids. RAIRO Theor. Informatics Appl. 32 (4-6) (1998)
Stephen L. Bloom, Zoltán Ésik
The Equational Logic of Fixed Points (Tutorial). Theor. Comput. Sci. 179 (1-2) (1997)
Stephen L. Bloom, Zoltán Ésik
Varieties Generated by Languages with Poset Operations. Math. Struct. Comput. Sci. 7 (6) (1997)
Stephen L. Bloom, Zoltán Ésik
Axiomatizing Shuffle and Concatenation in Languages. Inf. Comput. 139 (1) (1997)
Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes
Iteration 2-Theories: Extended Abstract. AMAST (1997)
Stephen L. Bloom, Nicoletta Sabadini, Robert F. C. Walters
Matrices, machines and behaviors. Appl. Categorical Struct. 4 (4) (1996)
Stephen L. Bloom, Zoltán Ésik
Free Shuffle Algebras in Language Varieties. Theor. Comput. Sci. 163 (1&2) (1996)
Stephen L. Bloom, Zoltán Ésik
Two Axiomatizations of a Star Semiring Quasi-Variety. Bull. EATCS 59 (1996)
Stephen L. Bloom, Zoltán Ésik
Fixed-Point Operations on ccc's. Part I. Theor. Comput. Sci. 155 (1) (1996)
Stephen L. Bloom, Zoltán Ésik
Nonfinite Axiomatizability of Shuffle Inequalities. TAPSOFT (1995)
Stephen L. Bloom, Zoltán Ésik
Some Equational Laws of Initiality in 2CCC's. Int. J. Found. Comput. Sci. 6 (2) (1995)
Stephen L. Bloom, Zoltán Ésik
Free Shuffle Algebras in Language Varieties (Extended Abstract). LATIN (1995)
Stephen L. Bloom, Zoltán Ésik
Solving Polynomial Fixed Point Equations. MFCS (1994)
Stephen L. Bloom, Zoltán Ésik
Equational Axioms for Regular Sets. Math. Struct. Comput. Sci. 3 (1) (1993)
Stephen L. Bloom, Zoltán Ésik
Matrix and Matricial Iteration Theories, Part I. J. Comput. Syst. Sci. 46 (3) (1993)
Stephen L. Bloom, Zoltán Ésik
Erratum: Iteration Algebras. Int. J. Found. Comput. Sci. 4 (1) (1993)
Stephen L. Bloom, Zoltán Ésik, Dirk Taubner
Iteration Theories of Synchronization Trees Inf. Comput. 102 (1) (1993)
Stephen L. Bloom, Zoltán Ésik
Some Quasi-Varieties of Iteration Theories. MFPS (1993)
Stephen L. Bloom, Zoltán Ésik
Matrix and Matricial Iteration Theories, Part II. J. Comput. Syst. Sci. 46 (3) (1993)
Stephen L. Bloom, Zoltán Ésik
Iteration Algebras. Int. J. Found. Comput. Sci. 3 (3) (1992)
Stephen L. Bloom, Zoltán Ésik
Cayley iff Stone. Bull. EATCS 43 (1991)
Stephen L. Bloom, Zoltán Ésik
Program Correctness and Matricial Iteration Theories. MFPS (1991)
Stephen L. Bloom, Zoltán Ésik
Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 (1991)
Stephen L. Bloom, Zoltán Ésik
Floyd-Hoare Logic in Iteration Theories. J. ACM 38 (4) (1991)
Stephen L. Bloom
A Note on Guarded Theories. Theor. Comput. Sci. 70 (1) (1990)
Stephen L. Bloom, Zoltán Ésik, Dirk Taubner
Iteration theories of synchronization trees Forschungsberichte, TU Munich (1990)
Stephen L. Bloom, Zoltán Ésik
Equational Logic of Circular Data Type Specification. Theor. Comput. Sci. 63 (3) (1989)
Stephen L. Bloom, Klaus Sutner
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. TAPSOFT, Vol.1 (1989)
Stephen L. Bloom
The Equational Logic of Iterative Processes. FCT (1989)
Stephen L. Bloom, Zoltán Ésik
Varieties of Iteration Theories. SIAM J. Comput. 17 (5) (1988)
Stephen L. Bloom, Ralph Tindell
A note on zero-congruences. Acta Cybern. 8 (1) (1987)
Stephen L. Bloom
The alternation number and a dot hierarchy of regular sets. Acta Cybern. 7 (4) (1986)
Stephen L. Bloom, Zoltán Ésik
Axiomatizing Schemes and Their Behaviors. J. Comput. Syst. Sci. 31 (3) (1985)
Stephen L. Bloom
Frontiers of one-letter languages. Acta Cybern. 7 (1) (1985)
Stephen L. Bloom, Douglas R. Troeger
A Logical Characterization of Observation Equivalence. Theor. Comput. Sci. 35 (1985)
Stephen L. Bloom, Zoltán Ésik
Some varieties of iteration theories. Bull. EATCS 24 (1984)
Stephen L. Bloom, Ralph Tindell
Varieties of "if-then-else". SIAM J. Comput. 12 (4) (1983)
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) (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) (1983)
Stephen L. Bloom, David B. Patterson
Easy Solutions are Hard To Find. CAAP (1981)
Stephen L. Bloom, Ralph Tindell
Compatible Orderings on the Metric Theory of Trees. SIAM J. Comput. 9 (4) (1980)
Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright
Vector Iteration in Pointed Iterative Theories. SIAM J. Comput. 9 (3) (1980)
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) (1980)
Stephen L. Bloom, Ralph Tindell
Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. Theor. Comput. Sci. 9 (1979)
Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell
On the Algebraic Atructure of Rooted Trees. J. Comput. Syst. Sci. 16 (3) (1978)
Stephen L. Bloom, Susanna Ginali, Joseph D. Rutledge
Scalar and Vector Iteration. J. Comput. Syst. Sci. 14 (2) (1977)
Stephen L. Bloom, Calvin C. Elgot
The Existence and Construction of Free Iterative Theories. J. Comput. Syst. Sci. 12 (3) (1976)
Stephen L. Bloom, Roman Suszko
Errata: "Investigations into the sentential calculus with identity". Notre Dame J. Formal Log. 17 (4) (1976)
Stephen L. Bloom
Varieties of Ordered Algebras. J. Comput. Syst. Sci. 13 (2) (1976)
Stephen L. Bloom
A note on the predicatively definable sets of N. N. Nepeîvoda. Math. Log. Q. 21 (1) (1975)
Stephen L. Bloom
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem. Notre Dame J. Formal Log. 14 (3) (1973)
Stephen L. Bloom, Roman Suszko
Investigations into the sentential calculus with identity. Notre Dame J. Formal Log. 13 (3) (1972)
Stephen L. Bloom
A semi-completeness theorem. Notre Dame J. Formal Log. 10 (3) (1969)
Stephen L. Bloom
A note on the arithmetical hierarchy. Notre Dame J. Formal Log. 9 (1) (1968)