default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen L. Bloom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j56]Stephen L. Bloom, YiDi Zhang:
A Note on Ordinal DFAs. Order 30(1): 151-164 (2013)- 2011
- [j55]Stephen L. Bloom, Zoltán Ésik:
Algebraic Linear Orderings. Int. J. Found. Comput. Sci. 22(2): 491-515 (2011) - 2010
- [j54]Stephen L. Bloom, Zoltán Ésik:
Algebraic Ordinals. Fundam. Informaticae 99(4): 383-407 (2010) - [j53]Stephen L. Bloom, Zoltán Ésik:
A Mezei-Wright theorem for categorical algebras. Theor. Comput. Sci. 411(2): 341-359 (2010) - [i6]Stephen L. Bloom, Zoltán Ésik:
Algebraic Linear Orderings. CoRR abs/1002.1624 (2010) - [i5]Stephen L. Bloom, YiDi Zhang:
A Note on Ordinal DFAs. CoRR abs/1005.2329 (2010)
2000 – 2009
- 2009
- [j52]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing rational power series over natural numbers. Inf. Comput. 207(7): 793-811 (2009) - [c17]Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
Cycle-Free Finite Automata in Partial Iterative Semirings. CAI 2009: 1-12 - [c16]Stephen L. Bloom, Zoltán Ésik:
Scattered Algebraic Linear Orderings. FICS 2009: 25-29 - [i4]Stephen L. Bloom, Zoltán Ésik:
Algebraic Ordinals. CoRR abs/0907.0877 (2009) - 2008
- [j51]Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
Partial Conway and Iteration Semirings. Fundam. Informaticae 86(1-2): 19-40 (2008) - [j50]Jirí Adámek, Stephen L. Bloom, Stefan Milius:
On Algebras with Iteration. J. Log. Comput. 18(6): 1047-1085 (2008) - 2007
- [c15]Stephen L. Bloom, Zoltán Ésik:
Regular and Algebraic Words and Ordinals. CALCO 2007: 1-15 - [i3]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing rational power series. CoRR abs/0712.1337 (2007) - [i2]Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
Partial Conway and iteration semirings. CoRR abs/0712.2952 (2007) - 2006
- [c14]Stephen L. Bloom, Zoltán Ésik:
Completing Categorical Algebras. IFIP TCS 2006: 231-249 - 2005
- [j49]Stephen L. Bloom, Zoltán Ésik:
The equational theory of regular words. Inf. Comput. 197(1-2): 55-89 (2005) - 2004
- [j48]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing omega and omega-op powers of words. RAIRO Theor. Informatics Appl. 38(1): 3-17 (2004) - 2003
- [j47]Stephen L. Bloom, Zoltán Ésik:
Deciding whether the frontier of a regular tree is scattered. Fundam. Informaticae 55(1): 1-21 (2003) - [j46]Stephen L. Bloom, Zoltán Ésik:
An Extension Theorem with an Application to Formal Tree Series. J. Autom. Lang. Comb. 8(2): 145-185 (2003) - [c13]Stephen L. Bloom, Zoltán Ésik:
Axioms for Regular Words: Extended Abstract. FSTTCS 2003: 50-61 - 2002
- [c12]Stephen L. Bloom, Zoltán Ésik:
Unique, guarded fixed points in an additive setting: Extended Abstract. CTCS 2002: 47-61 - 2001
- [j45]Stephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes:
Iteration 2-theories. Appl. Categorical Struct. 9(2): 173-216 (2001) - [j44]Stephen L. Bloom, Christian Choffrut:
Long words: the theory of concatenation and omega-power. Theor. Comput. Sci. 259(1-2): 533-548 (2001) - 2000
- [c11]Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN 2000: 367-376
1990 – 1999
- 1998
- [j43]Stephen L. Bloom, Zoltán Ésik:
Shuffle binoids. RAIRO Theor. Informatics Appl. 32(4-6): 175-198 (1998) - 1997
- [j42]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing Shuffle and Concatenation in Languages. Inf. Comput. 139(1): 62-91 (1997) - [j41]Stephen L. Bloom, Zoltán Ésik:
Varieties Generated by Languages with Poset Operations. Math. Struct. Comput. Sci. 7(6): 701-713 (1997) - [j40]Stephen L. Bloom, Zoltán Ésik:
The Equational Logic of Fixed Points (Tutorial). Theor. Comput. Sci. 179(1-2): 1-60 (1997) - [c10]Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes:
Iteration 2-Theories: Extended Abstract. AMAST 1997: 30-44 - 1996
- [j39]Stephen L. Bloom, Nicoletta Sabadini, Robert F. C. Walters:
Matrices, machines and behaviors. Appl. Categorical Struct. 4(4): 343-360 (1996) - [j38]Stephen L. Bloom, Zoltán Ésik:
Two Axiomatizations of a Star Semiring Quasi-Variety. Bull. EATCS 59 (1996) - [j37]Stephen L. Bloom, Zoltán Ésik:
Fixed-Point Operations on ccc's. Part I. Theor. Comput. Sci. 155(1): 1-38 (1996) - [j36]Stephen L. Bloom, Zoltán Ésik:
Free Shuffle Algebras in Language Varieties. Theor. Comput. Sci. 163(1&2): 55-98 (1996) - 1995
- [j35]Stephen L. Bloom, Zoltán Ésik:
Some Equational Laws of Initiality in 2CCC's. Int. J. Found. Comput. Sci. 6(2): 95-118 (1995) - [c9]Stephen L. Bloom, Zoltán Ésik:
Free Shuffle Algebras in Language Varieties (Extended Abstract). LATIN 1995: 99-111 - [c8]Stephen L. Bloom, Zoltán Ésik:
Nonfinite Axiomatizability of Shuffle Inequalities. TAPSOFT 1995: 318-333 - 1994
- [c7]Stephen L. Bloom, Zoltán Ésik:
Solving Polynomial Fixed Point Equations. MFCS 1994: 52-67 - 1993
- [b2]Stephen L. Bloom, Zoltán Ésik:
Iteration Theories - The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science, Springer 1993, ISBN 978-3-642-78036-3, pp. i-xv, 1-632 - [j34]Stephen L. Bloom, Zoltán Ésik, Dirk Taubner:
Iteration Theories of Synchronization Trees. Inf. Comput. 102(1): 1-55 (1993) - [j33]Stephen L. Bloom, Zoltán Ésik:
Erratum: Iteration Algebras. Int. J. Found. Comput. Sci. 4(1): 99 (1993) - [j32]Stephen L. Bloom, Zoltán Ésik:
Matrix and Matricial Iteration Theories, Part I. J. Comput. Syst. Sci. 46(3): 381-408 (1993) - [j31]Stephen L. Bloom, Zoltán Ésik:
Matrix and Matricial Iteration Theories, Part II. J. Comput. Syst. Sci. 46(3): 409-439 (1993) - [j30]Stephen L. Bloom, Zoltán Ésik:
Equational Axioms for Regular Sets. Math. Struct. Comput. Sci. 3(1): 1-24 (1993) - [c6]Stephen L. Bloom, Zoltán Ésik:
Some Quasi-Varieties of Iteration Theories. MFPS 1993: 378-409 - 1992
- [j29]Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras. Int. J. Found. Comput. Sci. 3(3): 245-302 (1992) - 1991
- [j28]Stephen L. Bloom, Zoltán Ésik:
Cayley iff Stone. Bull. EATCS 43: 159-161 (1991) - [j27]Stephen L. Bloom, Zoltán Ésik:
Floyd-Hoare Logic in Iteration Theories. J. ACM 38(4): 887-934 (1991) - [c5]Stephen L. Bloom, Zoltán Ésik:
Program Correctness and Matricial Iteration Theories. MFPS 1991: 457-476 - [c4]Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 1991: 264-274 - 1990
- [j26]Stephen L. Bloom:
A Note on Guarded Theories. Theor. Comput. Sci. 70(1): 73-83 (1990) - [i1]Stephen L. Bloom, Zoltán Ésik, Dirk Taubner:
Iteration theories of synchronization trees. Forschungsberichte, TU Munich TUM I 9014: 1-60 (1990)
1980 – 1989
- 1989
- [j25]Stephen L. Bloom, Zoltán Ésik:
Equational Logic of Circular Data Type Specification. Theor. Comput. Sci. 63(3): 303-331 (1989) - [c3]Stephen L. Bloom:
The Equational Logic of Iterative Processes. FCT 1989: 47-57 - [c2]Stephen L. Bloom, Klaus Sutner:
Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. TAPSOFT, Vol.1 1989: 134-148 - 1988
- [j24]Stephen L. Bloom, Zoltán Ésik:
Varieties of Iteration Theories. SIAM J. Comput. 17(5): 939-966 (1988) - 1987
- [j23]Stephen L. Bloom, Ralph Tindell:
A note on zero-congruences. Acta Cybern. 8(1): 1-4 (1987) - 1986
- [j22]Stephen L. Bloom:
The alternation number and a dot hierarchy of regular sets. Acta Cybern. 7(4): 355-358 (1986) - 1985
- [j21]Stephen L. Bloom:
Frontiers of one-letter languages. Acta Cybern. 7(1): 1-18 (1985) - [j20]Stephen L. Bloom, Zoltán Ésik:
Axiomatizing Schemes and Their Behaviors. J. Comput. Syst. Sci. 31(3): 375-393 (1985) - [j19]Stephen L. Bloom, Douglas R. Troeger:
A Logical Characterization of Observation Equivalence. Theor. Comput. Sci. 35: 43-53 (1985) - 1984
- [j18]Stephen L. Bloom, Zoltán Ésik:
Some varieties of iteration theories. Bull. EATCS 24: 53-65 (1984) - 1983
- [j17]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) - [j16]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) - [j15]Stephen L. Bloom, Ralph Tindell:
Varieties of "if-then-else". SIAM J. Comput. 12(4): 677-707 (1983) - 1982
- [b1]Calvin C. Elgot, Stephen L. Bloom:
Selected papers. Springer 1982, ISBN 978-3-540-90698-8, pp. I-XXIV, 1-460 - 1981
- [c1]Stephen L. Bloom, David B. Patterson:
Easy Solutions are Hard To Find. CAAP 1981: 135-146 - 1980
- [j14]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) - [j13]Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright:
Vector Iteration in Pointed Iterative Theories. SIAM J. Comput. 9(3): 525-540 (1980) - [j12]Stephen L. Bloom, Ralph Tindell:
Compatible Orderings on the Metric Theory of Trees. SIAM J. Comput. 9(4): 683-691 (1980)
1970 – 1979
- 1979
- [j11]Stephen L. Bloom, Ralph Tindell:
Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. Theor. Comput. Sci. 9: 265-286 (1979) - 1978
- [j10]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
- [j9]Stephen L. Bloom, Susanna Ginali, Joseph D. Rutledge:
Scalar and Vector Iteration. J. Comput. Syst. Sci. 14(2): 251-256 (1977) - 1976
- [j8]Stephen L. Bloom, Calvin C. Elgot:
The Existence and Construction of Free Iterative Theories. J. Comput. Syst. Sci. 12(3): 305-318 (1976) - [j7]Stephen L. Bloom:
Varieties of Ordered Algebras. J. Comput. Syst. Sci. 13(2): 200-212 (1976) - [j6]Stephen L. Bloom, Roman Suszko:
Errata: "Investigations into the sentential calculus with identity". Notre Dame J. Formal Log. 17(4): 640 (1976) - 1975
- [j5]Stephen L. Bloom:
A note on the predicatively definable sets of N. N. Nepeîvoda. Math. Log. Q. 21(1): 427-431 (1975) - 1973
- [j4]Stephen L. Bloom:
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem. Notre Dame J. Formal Log. 14(3): 408-410 (1973) - 1972
- [j3]Stephen L. Bloom, Roman Suszko:
Investigations into the sentential calculus with identity. Notre Dame J. Formal Log. 13(3): 289-308 (1972)
1960 – 1969
- 1969
- [j2]Stephen L. Bloom:
A semi-completeness theorem. Notre Dame J. Formal Log. 10(3): 303-308 (1969) - 1968
- [j1]Stephen L. Bloom:
A note on the arithmetical hierarchy. Notre Dame J. Formal Log. 9(1): 89-91 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
