Stephen L. Bloom

81 papers B 7Journal 62Unranked 10

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