 | 2009 |
|---|
| 63 |       | Stephen L. Bloom,
Zoltán Ésik,
Werner Kuich:
Cycle-Free Finite Automata in Partial Iterative Semirings.
CAI 2009: 1-12 |
| 62 | | Stephen L. Bloom,
Zoltán Ésik:
Algebraic Ordinals
CoRR abs/0907.0877: (2009) |
| 61 | | Stephen L. Bloom,
Zoltán Ésik:
Axiomatizing rational power series over natural numbers.
Inf. Comput. 207(7): 793-811 (2009) |
| 2008 |
|---|
| 60 | | Stephen L. Bloom,
Zoltán Ésik,
Werner Kuich:
Partial Conway and Iteration Semirings.
Fundam. Inform. 86(1-2): 19-40 (2008) |
| 59 | | Jirí Adámek,
Stephen L. Bloom,
Stefan Milius:
On Algebras with Iteration.
J. Log. Comput. 18(6): 1047-1085 (2008) |
| 2007 |
|---|
| 58 | | Stephen L. Bloom,
Zoltán Ésik:
Regular and Algebraic Words and Ordinals.
CALCO 2007: 1-15 |
| 57 | | Stephen L. Bloom,
Zoltán Ésik:
Axiomatizing rational power series
CoRR abs/0712.1337: (2007) |
| 56 | | Stephen L. Bloom,
Zoltán Ésik,
Werner Kuich:
Partial Conway and iteration semirings
CoRR abs/0712.2952: (2007) |
| 2006 |
|---|
| 55 | | Stephen L. Bloom,
Zoltán Ésik:
Completing Categorical Algebras.
IFIP TCS 2006: 231-249 |
| 2005 |
|---|
| 54 | | Stephen L. Bloom,
Zoltán Ésik:
The equational theory of regular words.
Inf. Comput. 197(1-2): 55-89 (2005) |
| 2004 |
|---|
| 53 | | Stephen L. Bloom,
Zoltán Ésik:
Axiomatizing omega and omega-op powers of words.
ITA 38(1): 3-17 (2004) |
| 2003 |
|---|
| 52 | | Stephen L. Bloom,
Zoltán Ésik:
Axioms for Regular Words: Extended Abstract.
FSTTCS 2003: 50-61 |
| 51 | | Stephen L. Bloom,
Zoltán Ésik:
Deciding whether the frontier of a regular tree is scattered.
Fundam. Inform. 55(1): 1-21 (2003) |
| 50 |  | 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) |
| 2002 |
|---|
| 49 | | Stephen L. Bloom,
Zoltán Ésik:
Unique, guarded fixed points in an additive setting: Extended Abstract.
Electr. Notes Theor. Comput. Sci. 69: (2002) |
| 2001 |
|---|
| 48 | | Stephen L. Bloom,
Zoltán Ésik,
Anna Labella,
Ernest G. Manes:
Iteration 2-theories.
Applied Categorical Structures 9(2): 173-216 (2001) |
| 47 | | Stephen L. Bloom,
Christian Choffrut:
Long words: the theory of concatenation and omega-power.
Theor. Comput. Sci. 259(1-2): 533-548 (2001) |
| 2000 |
|---|
| 46 | | Stephen L. Bloom,
Zoltán Ésik:
Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract.
LATIN 2000: 367-376 |
| 1997 |
|---|
| 45 | | Stephen L. Bloom,
Anna Labella,
Zoltán Ésik,
Ernest G. Manes:
Iteration 2-Theories: Extended Abstract.
AMAST 1997: 30-44 |
| 44 | | Stephen L. Bloom,
Zoltán Ésik:
Axiomatizing Shuffle and Concatenation in Languages.
Inf. Comput. 139(1): 62-91 (1997) |
| 43 | | Stephen L. Bloom,
Zoltán Ésik:
Varieties Generated by Languages with Poset Operations.
Mathematical Structures in Computer Science 7(6): 701-713 (1997) |
| 42 | | Stephen L. Bloom,
Zoltán Ésik:
The Equational Logic of Fixed Points (Tutorial).
Theor. Comput. Sci. 179(1-2): 1-60 (1997) |
| 1996 |
|---|
| 41 | | Stephen L. Bloom,
Zoltán Ésik:
Two Axiomatizations of a Star Semiring Quasi-Variety.
Bulletin of the EATCS 59: (1996) |
| 40 | | Stephen L. Bloom,
Zoltán Ésik:
Fixed-Point Operations on ccc's. Part I.
Theor. Comput. Sci. 155(1): 1-38 (1996) |
| 39 | | Stephen L. Bloom,
Zoltán Ésik:
Free Shuffle Algebras in Language Varieties.
Theor. Comput. Sci. 163(1&2): 55-98 (1996) |
| 1995 |
|---|
| 38 | | Stephen L. Bloom,
Zoltán Ésik:
Free Shuffle Algebras in Language Varieties (Extended Abstract).
LATIN 1995: 99-111 |
| 37 | | Stephen L. Bloom,
Zoltán Ésik:
Nonfinite Axiomatizability of Shuffle Inequalities.
TAPSOFT 1995: 318-333 |
| 36 | | Stephen L. Bloom,
Zoltán Ésik:
Some Equational Laws of Initiality in 2CCC's.
Int. J. Found. Comput. Sci. 6(2): 95-118 (1995) |
| 1994 |
|---|
| 35 | | Stephen L. Bloom,
Zoltán Ésik:
Solving Polynomial Fixed Point Equations.
MFCS 1994: 52-67 |
| 1993 |
|---|
| 34 | | Stephen L. Bloom,
Zoltán Ésik:
Some Quasi-Varieties of Iteration Theories.
MFPS 1993: 378-409 |
| 33 | | Stephen L. Bloom,
Zoltán Ésik,
Dirk Taubner:
Iteration Theories of Synchronization Trees
Inf. Comput. 102(1): 1-55 (1993) |
| 32 | | Stephen L. Bloom,
Zoltán Ésik:
Erratum: Iteration Algebras.
Int. J. Found. Comput. Sci. 4(1): 99 (1993) |
| 31 | | Stephen L. Bloom,
Zoltán Ésik:
Matrix and Matricial Iteration Theories, Part I.
J. Comput. Syst. Sci. 46(3): 381-408 (1993) |
| 30 | | Stephen L. Bloom,
Zoltán Ésik:
Matrix and Matricial Iteration Theories, Part II.
J. Comput. Syst. Sci. 46(3): 409-439 (1993) |
| 29 | | Stephen L. Bloom,
Zoltán Ésik:
Equational Axioms for Regular Sets.
Mathematical Structures in Computer Science 3(1): 1-24 (1993) |
| 1992 |
|---|
| 28 | | Stephen L. Bloom,
Zoltán Ésik:
Iteration Algebras.
Int. J. Found. Comput. Sci. 3(3): 245-302 (1992) |
| 1991 |
|---|
| 27 | | Stephen L. Bloom,
Zoltán Ésik:
Program Correctness and Matricial Iteration Theories.
MFPS 1991: 457-476 |
| 26 | | Stephen L. Bloom,
Zoltán Ésik:
Iteration Algebras (Extended Abstract).
TAPSOFT, Vol.1 1991: 264-274 |
| 25 | | Stephen L. Bloom,
Zoltán Ésik:
Cayley iff Stone.
Bulletin of the EATCS 43: 159-161 (1991) |
| 24 | | Stephen L. Bloom,
Zoltán Ésik:
Floyd-Hoare Logic in Iteration Theories.
J. ACM 38(4): 887-934 (1991) |
| 1990 |
|---|
| 23 | | Stephen L. Bloom:
A Note on Guarded Theories.
Theor. Comput. Sci. 70(1): 73-83 (1990) |
| 1989 |
|---|
| 22 | | Stephen L. Bloom:
The Equational Logic of Iterative Processes.
FCT 1989: 47-57 |
| 21 | | Stephen L. Bloom,
Klaus Sutner:
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets.
TAPSOFT, Vol.1 1989: 134-148 |
| 20 | | Stephen L. Bloom,
Zoltán Ésik:
Equational Logic of Circular Data Type Specification.
Theor. Comput. Sci. 63(3): 303-331 (1989) |
| 1988 |
|---|
| 19 | | Stephen L. Bloom,
Zoltán Ésik:
Varieties of Iteration Theories.
SIAM J. Comput. 17(5): 939-966 (1988) |
| 1987 |
|---|
| 18 | | Stephen L. Bloom,
Ralph Tindell:
A note on zero-congruences.
Acta Cybern. 8: 1-4 (1987) |
| 1986 |
|---|
| 17 | | Stephen L. Bloom:
The alternation number and a dot hierarchy of regular sets.
Acta Cybern. 7(4): 355-358 (1986) |
| 1985 |
|---|
| 16 | | Stephen L. Bloom:
Frontiers of one-letter languages.
Acta Cybern. 7(1): 1-18 (1985) |
| 15 | | Stephen L. Bloom,
Zoltán Ésik:
Axiomatizing Schemes and Their Behaviors.
J. Comput. Syst. Sci. 31(3): 375-393 (1985) |
| 14 | | Stephen L. Bloom,
Douglas R. Troeger:
A Logical Characterization of Observation Equivalence.
Theor. Comput. Sci. 35: 43-53 (1985) |
| 1984 |
|---|
| 13 | | Stephen L. Bloom,
Zoltán Ésik:
Some varieties of iteration theories.
Bulletin of the EATCS 24: 53-65 (1984) |
| 1983 |
|---|
| 12 | | 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) |
| 11 | | 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) |
| 10 | | Stephen L. Bloom,
Ralph Tindell:
Varieties of ``if-then-else''.
SIAM J. Comput. 12(4): 677-707 (1983) |
| 1981 |
|---|
| 9 | | Stephen L. Bloom,
David B. Patterson:
Easy Solutions are Hard To Find.
CAAP 1981: 135-146 |
| 1980 |
|---|
| 8 | | 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) |
| 7 | | Stephen L. Bloom,
Calvin C. Elgot,
Jesse B. Wright:
Vector Iteration in Pointed Iterative Theories.
SIAM J. Comput. 9(3): 525-540 (1980) |
| 6 | | Stephen L. Bloom,
Ralph Tindell:
Compatible Orderings on the Metric Theory of Trees.
SIAM J. Comput. 9(4): 683-691 (1980) |
| 1979 |
|---|
| 5 | | Stephen L. Bloom,
Ralph Tindell:
Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes.
Theor. Comput. Sci. 9: 265-286 (1979) |
| 1978 |
|---|
| 4 | | Calvin C. Elgot,
Stephen L. Bloom,
Ralph Tindell:
On the Algebraic Atructure of Rooted Trees.
J. Comput. Syst. Sci. 16(3): 362-399 (1978) |
| 1977 |
|---|
| 3 | | Stephen L. Bloom,
Susanna Ginali,
Joseph D. Rutledge:
Scalar and Vector Iteration.
J. Comput. Syst. Sci. 14(2): 251-256 (1977) |
| 1976 |
|---|
| 2 | | Stephen L. Bloom,
Calvin C. Elgot:
The Existence and Construction of Free Iterative Theories.
J. Comput. Syst. Sci. 12(3): 305-318 (1976) |
| 1 | | Stephen L. Bloom:
Varieties of Ordered Algebras.
J. Comput. Syst. Sci. 13(2): 200-212 (1976) |
