Automata and Categories: Finiteness Contra Minimality. - Jirí Adámek (MFCS, 1975)

Remarks on Fixed Points of Functors. - Jirí Adámek; Václav Koubek (FCT, 1977)

Recognizable and Regular Languages in a Category. - Jirí Adámek; Vera Trnková (FCT, 1977)

On Languages, Accepted by Machines in the Category of Sets. - Vera Trnková; Jirí Adámek (MFCS, 1977)

Functorial algebras and automata. - Jirí Adámek; Václav Koubek (Kybernetika, 1977)

Tree-group automata. - Vera Trnková; Jirí Adámek (FCT, 1979)

Least Fixed Point of a Functor. - Jirí Adámek; Václav Koubek (J. Comput. Syst. Sci., 1979)

On an equivalence of system-theoretical and categorical concepts. - Jirí Adámek; Hartmut Ehrig; Vera Trnková (Kybernetika, 1980)

Observability and Nerode Equivalence in Concrete C5ategories. - Jirí Adámek (FCT, 1981)

Tree Constructions of Free Continuous Algebras. - Jirí Adámek; Evelyn Nelson; Jan Reiterman (J. Comput. Syst. Sci., 1982)

Theory of Mathematical Structures. - Jirí Adámek (Reidel, 1983)

Separately Continuous Algebras. - Jirí Adámek; Evelyn Nelson (Theor. Comput. Sci., 1983)

Cartesian Closed Categories, Quasitopoi and Topological Universes. - Jirí Adámek; Horst Herrlich (Mathematical Foundations of Programming Semantics, 1985)

Continuous Semilattices. - Jirí Adámek; Jan Reiterman; Evelyn Nelson (Theor. Comput. Sci., 1986)

On the logic of continuous algebras. - Jirí Adámek; Alan H. Mekler; Evelyn Nelson; Jan Reiterman (Notre Dame J. Formal Log., 1988)

Foundations of coding - theory and applications of error-correcting codes with an introduction to cryptography and information theory. - Jirí Adámek (Wiley, 1991)

On orthogonal subcategories of locally presentable categories. - Jirí Adámek; Jirí Rosický (Discret. Math., 1992)

Banach's Fixed-Point Theorem as a base for data-type equations. - Jirí Adámek; Jan Reiterman (Appl. Categorical Struct., 1994)

Continuous Algebras Revisited. - Jirí Adámek; Evelyn Nelson; Jan Reiterman (J. Comput. Syst. Sci., 1995)

Finitary Sketches and Finitely Accessible Categories. - Jirí Adámek; Jirí Rosický (Math. Struct. Comput. Sci., 1995)

On the Greatest Fixed Point of a Set Functor. - Jirí Adámek; Václav Koubek (Theor. Comput. Sci., 1995)

Recursive Data Types in Algebraically omega-Complete Categories - Jirí Adámek (Inf. Comput., 1995)

A remark on fixed points of functors in topological categories. - Jirí Adámek (Appl. Categorical Struct., 1996)

On geometric and finitary sketches. - Jirí Adámek; Jirí Rosický (Appl. Categorical Struct., 1996)

Finitary Sketches. - Jirí Adámek; Peter T. Johnstone; Johann A. Makowsky; Jirí Rosický (J. Symb. Log., 1997)

A Categorical Generalization of Scott Domains. - Jirí Adámek (Math. Struct. Comput. Sci., 1997)

Morita Equivalence of Sketches. - Jirí Adámek; Francis Borceux (Appl. Categorical Struct., 2000)

Constructions of Solid Hulls. - Jirí Adámek; Lurdes Sousa (Appl. Categorical Struct., 2001)

A Coalgebraic View of Infinite Trees and Iteration. - Peter Aczel; Jirí Adámek; Jirí Velebil (CMCS, 2001)

From Varieties of Algebras to Covarieties of Coalgebras. - Jirí Adámek; Hans-E. Porst (CMCS, 2001)

Parametric corecursion and completely iterative monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (FICS, 2002)

Weak Factorization Systems and Topological Functors. - Jirí Adámek; Horst Herrlich; Jirí Rosický; Walter Tholen (Appl. Categorical Struct., 2002)

Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS, 2002)

On Rational Monads and Free Iterative Theories. - Jirí Adámek; Stefan Milius; Jirí Velebil (CTCS, 2002)

Final Coalgebras are Ideal Completions of Initial Algebras. - Jirí Adámek (J. Log. Comput., 2002)

On abstract data types presented by multiequations. - Jirí Adámek; Michel Hébert; Jirí Rosický (Theor. Comput. Sci., 2002)

Static analysis of component systems using behavior protocols. - Jirí Adámek (OOPSLA Companion, 2003)

Some Remarks on Finitary and Iterative Monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Appl. Categorical Struct., 2003)

On a Description of Terminal Coalgebras and Iterative Theories. - Jirí Adámek (CMCS, 2003)

Free Iterative Theories: A Coalgebraic View. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2003)

On Varieties and Covarieties in a Category. - Jirí Adámek; Hans-E. Porst (Math. Struct. Comput. Sci., 2003)

Infinite trees and completely iterative theories: a coalgebraic view. - Peter Aczel; Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2003)

On final coalgebras of continuous functors. - Jirí Adámek (Theor. Comput. Sci., 2003)

Preface. - Jirí Adámek; Martín Hötzel Escardó; Martin Hofmann 001 (Theor. Comput. Sci., 2003)

Partial Bindings of Components - Any Harm?. - Jirí Adámek; Frantisek Plásil (APSEC, 2004)

Erroneous architecture is a relative concept. - Jirí Adámek; Frantisek Plásil (IASTED Conf. on Software Engineering and Applications, 2004)

Preface. - Jirí Adámek; Stefan Milius (CMCS, 2004)

From Iterative Algebras to Iterative Theories (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS, 2004)

Iterative Algebras for a Base. - Jirí Adámek; Stefan Milius; Jirí Velebil (CTCS, 2004)

On quasivarieties and varieties as categories. - Jirí Adámek (Stud Logica, 2004)

On coalgebra based on classes. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2004)

On tree coalgebras and coalgebra presentations. - Jirí Adámek; Hans-E. Porst (Theor. Comput. Sci., 2004)

Algebra 'cap' Coalgebra = Presheaves. - Jirí Adámek (CALCO, 2005)

A Logic of Coequations. - Jirí Adámek (CSL, 2005)

Behavior Assembly and Composition of Use Cases - UML 2.0 Perspective. - Vladimir Mencl; Frantisek Plásil; Jirí Adámek (IASTED Conf. on Software Engineering, 2005)

Elgot Algebras: (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (MFPS, 2005)

A general final coalgebra theorem. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2005)

Component composition errors and update atomicity: static analysis. - Jirí Adámek; Frantisek Plásil (J. Softw. Maintenance Res. Pract., 2005)

Addressing Unbounded Parallelism in Verification of Software Components. - Jirí Adámek (SNPD, 2006)

How Iterative are Iterative Algebras? - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS, 2006)

Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. - Jirí Adámek; Stefan Milius (Inf. Comput., 2006)

Terminal coalgebras and free iterative theories. - Jirí Adámek; Stefan Milius (Inf. Comput., 2006)

Elgot Algebras. - Jirí Adámek; Stefan Milius; Jirí Velebil (Log. Methods Comput. Sci., 2006)

Iterative algebras at work. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2006)

The intersection of algebra and coalgebra. - Jirí Adámek (Theor. Comput. Sci., 2006)

What Are Iteration Theories? - Jirí Adámek; Stefan Milius; Jirí Velebil (MFCS, 2007)

Recursive coalgebras of finitary functors. - Jirí Adámek; Dominik Lücke; Stefan Milius (RAIRO Theor. Informatics Appl., 2007)

Algebras with parametrized iterativity. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2007)

Perspectives in component-based software engineering. - Jirí Adámek; Petr Hnetynka (SEESE@ICSE, 2008)

Carmen: Software Component Model Checker. - Ales Plsek; Jirí Adámek (QoSA, 2008)

Checking Session-Oriented Interactions between Web Services. - Pavel Parízek; Jirí Adámek (EUROMICRO-SEAA, 2008)

Preface. - Jirí Adámek; Clemens Kupke (CMCS, 2008)

Bases for parametrized iterativity. - Jirí Adámek; Stefan Milius; Jirí Velebil (Inf. Comput., 2008)

On Algebras with Iteration. - Jirí Adámek; Stephen L. Bloom; Stefan Milius (J. Log. Comput., 2008)

Abstract and Concrete Categories - The Joy of Cats. - Jirí Adámek; Horst Herrlich; George E. Strecker (Dover Publications, 2009)

A Description of Iterative Reflections of Monads (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (FoSSaCS, 2009)

The Orthogonal Subcategory Problem and the Small Object Argument. - Jirí Adámek; Michel Hébert; Lurdes Sousa (Appl. Categorical Struct., 2009)

Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (MFPS, 2009)

Automated Construction of Reasonable Environment for Java Components. - Pavel Parízek; Jirí Adámek; Tomas Kalibera (FESCA@ETAPS, 2009)

Recursive Program Schemes and Context-Free Monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS@ETAPS, 2010)

Equational properties of iterative monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Inf. Comput., 2010)

Presentation of Set Functors: A Coalgebraic Perspective. - Jirí Adámek; H. Peter Gumm; Vera Trnková (J. Log. Comput., 2010)

Iterative reflections of monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2010)

From Corecursive Algebras to Corecursive Monads. - Jirí Adámek; Mahdieh Haddadi; Stefan Milius (CALCO, 2011)

Power-Set Functors and Saturated Trees. - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (CSL, 2011)

Semantics of Higher-Order Recursion Schemes - Jirí Adámek; Stefan Milius; Jirí Velebil (Log. Methods Comput. Sci., 2011)

Elgot theories: a new perspective on the equational properties of iteration. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2011)

Initial algebras and terminal coalgebras in many-sorted sets. - Jirí Adámek; Vera Trnková (Math. Struct. Comput. Sci., 2011)

On second-order iterative monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2011)

Theoretische Informatik. - Jirí Adámek; Roland Vollmar; Dietmar Wätjen (40 Jahre Informatik @ Braunschweig, 2012)

On Finitary Functors and Their Presentations. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CMCS, 2012)

A Coalgebraic Perspective on Minimization and Determinization. - Jirí Adámek; Filippo Bonchi; Mathias Hülsbusch; Barbara König 001; Stefan Milius; Alexandra Silva 001 (FoSSaCS, 2012)

Well-Pointed Coalgebras (Extended Abstract). - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (FoSSaCS, 2012)

Coproducts of Monads on Set. - Jirí Adámek; Stefan Milius; Nathan J. Bowler; Paul Blain Levy (LICS, 2012)

Well-Pointed Coalgebras - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (Log. Methods Comput. Sci., 2013)

How iterative reflections of monads are constructed. - Jirí Adámek; Stefan Milius; Jirí Velebil (Inf. Comput., 2013)

Canonical Nondeterministic Automata. - Robert S. R. Myers; Jirí Adámek; Stefan Milius; Henning Urbat (CMCS, 2014)

Generalized Eilenberg Theorem I: Local Varieties of Languages. - Jirí Adámek; Stefan Milius; Robert S. R. Myers; Henning Urbat (FoSSaCS, 2014)

Colimits of Monads. - Jirí Adámek (CoRR, 2014)

Corecursive Algebras, Corecursive Monads and Bloom Monads. - Jirí Adámek; Mahdieh Haddadi; Stefan Milius (Log. Methods Comput. Sci., 2014)

On Continuous Nondeterminism and State Minimality. - Jirí Adámek; Robert S. R. Myers; Henning Urbat; Stefan Milius (MFPS, 2014)

Base modules for parametrized iterativity. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2014)

Syntactic Monoids in a Category. - Jirí Adámek; Stefan Milius; Henning Urbat (CALCO, 2015)

Varieties of Languages in a Category. - Jirí Adámek; Robert S. R. Myers; Henning Urbat; Stefan Milius (LICS, 2015)

On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. - Jirí Adámek; Paul Blain Levy; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (Appl. Categorical Struct., 2015)

On finitary functors and their presentations. - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Henning Urbat (J. Comput. Syst. Sci., 2015)

Kan injectivity in order-enriched categories. - Jirí Adámek; Lurdes Sousa; Jirí Velebil (Math. Struct. Comput. Sci., 2015)

Coalgebraic constructions of canonical nondeterministic automata. - Robert S. R. Myers; Jirí Adámek; Stefan Milius; Henning Urbat (Theor. Comput. Sci., 2015)

Fixed Points of Functors - A Short Abstract. - Jirí Adámek (CMCS, 2016)

Profinite Monads, Profinite Equations, and Reiterman's Theorem. - Liang-Ting Chen 001; Jirí Adámek; Stefan Milius; Henning Urbat (FoSSaCS, 2016)

Fixed Points of Set Functors: How Many Iterations are Needed? - Jirí Adámek; Václav Koubek; Thorsten Palm (Appl. Categorical Struct., 2016)

One Eilenberg Theorem to Rule Them All. - Henning Urbat; Jirí Adámek; Liang-Ting Chen 001; Stefan Milius (CoRR, 2016)

On Corecursive Algebras for Functors Preserving Coproducts. - Jirí Adámek; Stefan Milius (CALCO, 2017)

Eilenberg Theorems for Free. - Henning Urbat; Jirí Adámek; Liang-Ting Chen 001; Stefan Milius (MFCS, 2017)

On Algebras with Effectful Iteration. - Stefan Milius; Jirí Adámek; Henning Urbat (CMCS, 2018)

A Formula for Codensity Monads and Density Comonads. - Jirí Adámek; Lurdes Sousa (Appl. Categorical Struct., 2018)

Fixed points of functors. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (J. Log. Algebraic Methods Program., 2018)

A Categorical Approach to Syntactic Monoids. - Jirí Adámek; Stefan Milius; Henning Urbat (Log. Methods Comput. Sci., 2018)

On Terminal Coalgebras Derived from Initial Algebras. - Jirí Adámek (CALCO, 2019)

On functors preserving coproducts and algebras with iterativity. - Jirí Adámek; Stefan Milius (Theor. Comput. Sci., 2019)

Generalized Eilenberg Theorem: Varieties of Languages in a Category. - Jirí Adámek; Stefan Milius; Robert S. R. Myers; Henning Urbat (ACM Trans. Comput. Log., 2019)

Approximate Coalgebra Homomorphisms and Approximate Solutions. - Jirí Adámek (CMCS, 2020)

On Free Completely Iterative Algebras. - Jirí Adámek (CSL, 2020)

On Well-Founded and Recursive Coalgebras. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (FoSSaCS, 2020)

Initial Algebras Without Iteration ((Co)algebraic pearls). - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CALCO, 2021)

Which Categories Are Varieties? ((Co)algebraic pearls). - Jirí Adámek; Jirí Rosický (CALCO, 2021)

An Initial Algebra Theorem Without Iteration. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CoRR, 2021)

Algebraic cocompleteness and finitary functors. - Jirí Adámek (Log. Methods Comput. Sci., 2021)

On the behaviour of coalgebras with side effects and algebras with effectful iteration. - Jirí Adámek; Stefan Milius; Henning Urbat (J. Log. Comput., 2021)

Finitary monads on the category of posets. - Jirí Adámek; Chase Ford; Stefan Milius; Lutz Schröder (Math. Struct. Comput. Sci., 2021)

Reiterman's Theorem on Finite Algebras for a Monad. - Jirí Adámek; Liang-Ting Chen 001; Stefan Milius; Henning Urbat (ACM Trans. Comput. Log., 2021)

Varieties of Quantitative Algebras and Their Monads. - Jirí Adámek (LICS, 2022)

A categorical view of varieties of ordered algebras. - Jirí Adámek; Matej Dostál; Jirí Velebil (Math. Struct. Comput. Sci., 2022)

Strongly Finitary Monads for Varieties of Quantitative Algebras. - Jirí Adámek; Matej Dostál; Jirí Velebil (CALCO, 2023)

On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CALCO, 2023)

On Kripke, Vietoris and Hausdorff Polynomial Functors. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CoRR, 2023)

Terminal Coalgebras for Finitary Functors. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CALCO, 2025)