Stephen L. Bloom

YiDi Zhang

Order, 2013

2011

Algebraic Linear Orderings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

2010

A Mezei-Wright theorem for categorical algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Algebraic Ordinals.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

2009

Axiomatizing rational power series over natural numbers.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Scattered Algebraic Linear Orderings.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Cycle-Free Finite Automata in Partial Iterative Semirings.

[BibT_eX]

[DOI]

Werner Kuich

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

On Algebras with Iteration.

[BibT_eX]

[DOI]

Jirí Adámek

Stefan Milius

J. Log. Comput., 2008

Partial Conway and Iteration Semirings.

[BibT_eX]

[DOI]

Werner Kuich

Fundam. Informaticae, 2008

2007

Axiomatizing rational power series

[BibT_eX]

[DOI]

CoRR, 2007

Regular and Algebraic Words and Ordinals.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006

Completing Categorical Algebras.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005

The equational theory of regular words.

[BibT_eX]

[DOI]

Inf. Comput., 2005

2004

Axiomatizing omega and omega-op powers of words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

2003

An Extension Theorem with an Application to Formal Tree Series.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Deciding whether the frontier of a regular tree is scattered.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Axioms for Regular Words: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Unique, guarded fixed points in an additive setting: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 2002

2001

Long words: the theory of concatenation and omega-power.

[BibT_eX]

[DOI]

Christian Choffrut

Theor. Comput. Sci., 2001

Iteration 2-theories.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2001

2000

Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1998

Shuffle binoids.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1998

1997

The Equational Logic of Fixed Points (Tutorial).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Varieties Generated by Languages with Poset Operations.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1997

Axiomatizing Shuffle and Concatenation in Languages.

[BibT_eX]

[DOI]

Inf. Comput., 1997

Iteration 2-Theories: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1997

1996

Free Shuffle Algebras in Language Varieties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Fixed-Point Operations on ccc's. Part I.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Two Axiomatizations of a Star Semiring Quasi-Variety.

[BibT_eX]

Bull. EATCS, 1996

Matrices, machines and behaviors.

[BibT_eX]

[DOI]

Nicoletta Sabadini

Robert F. C. Walters

Appl. Categorical Struct., 1996

1995

Some Equational Laws of Initiality in 2CCC's.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1995

Nonfinite Axiomatizability of Shuffle Inequalities.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Free Shuffle Algebras in Language Varieties (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994

Solving Polynomial Fixed Point Equations.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993

Iteration Theories - The Equational Logic of Iterative Processes

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science, Springer, ISBN: 0387563784, 1993

Equational Axioms for Regular Sets.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1993

Matrix and Matricial Iteration Theories, Part II.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

Matrix and Matricial Iteration Theories, Part I.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

Erratum: Iteration Algebras.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Some Quasi-Varieties of Iteration Theories.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

Iteration Algebras.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

1991

Floyd-Hoare Logic in Iteration Theories.

[BibT_eX]

[DOI]

J. ACM, 1991

Cayley iff Stone.

[BibT_eX]

Bull. EATCS, 1991

Iteration Algebras (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Program Correctness and Matricial Iteration Theories.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1991

1990

Iteration theories of synchronization trees

[BibT_eX]

[DOI]

Dirk Taubner

Forschungsberichte, TU Munich, 1990

A Note on Guarded Theories.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

1989

Equational Logic of Circular Data Type Specification.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Shuffle Equations, Parallel Transition Systems and Equational Petri Nets.

[BibT_eX]

[DOI]

Klaus Sutner

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

The Equational Logic of Iterative Processes.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Varieties of Iteration Theories.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

1987

A note on zero-congruences.

[BibT_eX]

[DOI]

Acta Cybern., 1987

1986

The alternation number and a dot hierarchy of regular sets.

[BibT_eX]

[DOI]

Acta Cybern., 1986

1985

A Logical Characterization of Observation Equivalence.

[BibT_eX]

[DOI]

Douglas R. Troeger

Theor. Comput. Sci., 1985

Axiomatizing Schemes and Their Behaviors.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1985

Frontiers of one-letter languages.

[BibT_eX]

[DOI]

Acta Cybern., 1985

1984

Some varieties of iteration theories.

[BibT_eX]

Bull. EATCS, 1984

1983

Varieties of "if-then-else".

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

Recursion and Iteration in Continuous Theories: The "M-Construction".

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

All Solutions of a System of Recursion Equations in Infinite Trees and Other Contraction Theories.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

1982

Selected papers.

[BibT_eX]

Springer, ISBN: 978-3-540-90698-8, 1982

1981

Easy Solutions are Hard To Find.

[BibT_eX]

[DOI]

David B. Patterson

Proceedings of the CAAP '81, 1981

1980

Compatible Orderings on the Metric Theory of Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

Vector Iteration in Pointed Iterative Theories.

[BibT_eX]

[DOI]

Jesse B. Wright

SIAM J. Comput., 1980

Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation.

[BibT_eX]

[DOI]

Jesse B. Wright

SIAM J. Comput., 1980

1979

Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

1978

On the Algebraic Atructure of Rooted Trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1978

1977

Scalar and Vector Iteration.

[BibT_eX]

[DOI]

Susanna Ginali

Joseph D. Rutledge

J. Comput. Syst. Sci., 1977

1976

Errata: "Investigations into the sentential calculus with identity".

[BibT_eX]

[DOI]

Roman Suszko

Notre Dame J. Formal Log., 1976

The Existence and Construction of Free Iterative Theories.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

Varieties of Ordered Algebras.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

1975

A note on the predicatively definable sets of N. N. Nepeîvoda.

[BibT_eX]

[DOI]

Math. Log. Q., 1975

1973

Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1973

1972

Investigations into the sentential calculus with identity.

[BibT_eX]

[DOI]

Roman Suszko

Notre Dame J. Formal Log., 1972

1969

A semi-completeness theorem.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1969

1968

A note on the arithmetical hierarchy.

[BibT_eX]

[DOI]