Skip to main content
SpringerLink
Log in

Varietors and machines in a category

  • Published:
algebra universalis Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • [A1]J. Adámek,Free algebras and automata realizations in the language of categories, Comment. Math. Univ. Carolinae15 (1974), 589–602.

    MATH  MathSciNet  Google Scholar 

  • [A2]J. Adámek,Automata and categories: finiteness contra minimality, Lect. Notes in Comp. Sci.12 (Math. Foundation of Comp. Sci.) Springer-Verlag 1975, 160–166.

    Google Scholar 

  • [A3]J. Adámek,Limits and colimits in generalized algebraic categories, Czech. Math. J.26 (1976), 55–64.

    MATH  Google Scholar 

  • [A4]J. Adámek,Cogeneration of algebras in regular categories, Bull. Austral. Math. Soc.15 (1976), 355–370.

    Article  MATH  MathSciNet  Google Scholar 

  • [A5]J. Adámek,Realization theory for automata in categories, J. Pure Appl. Algebra9 (1977), 281–296.

    Article  MATH  Google Scholar 

  • [A6]J. Adámek,Categorial realization theory I, II, “Algebraische Modelle, Kategorien und Grupoide”, Akademie-Verlag, Berlin 1979, 111–136.

    Google Scholar 

  • [A7]J. Adámek,Colimits of algebras revisited, Bull. Austral. Math. Soc.17 (1977), 433–450.

    MATH  MathSciNet  Google Scholar 

  • [A8]J. Adámek,On the cogeneration of algebras, Math. Nachrichten88 (1979), 373–384.

    MATH  Google Scholar 

  • [A9]J. Adámek,Finitary varietors, Proc. “Second workshop meeting on categorical and algebraic methods in computer science and system theory” Forschungsbericht74, University Dortmund 1978.

  • [A10]J. Adámek,Construction of free ordered algebras, to appear

  • [AET]J. Adámek, H. Ehrig, andV. Trnková,An equivalence of system theoretical and categorical notions, to appear in Kybernedika (Praha).

  • [AK1]J. Adámek andV. Koubek,Coequalizers in generalized algebraic categories, Comment. Math. Univ. Carolinae13 (1972), 311–324.

    MATH  MathSciNet  Google Scholar 

  • [AK2]J. Adámek andV. Koubek Remarks on fixed points of functors, Lect. Notes Comp. Sci.56 (Fundamentals of comp. theory), Springer Verlag 1977, 199–205.

    MATH  Google Scholar 

  • [AK3]J. Adámek andV. Koubek,Functorial algebras and automata, Kybernetika13 (1977), 245–260.

    MATH  MathSciNet  Google Scholar 

  • [AK4]J. Adámek andV. Koubek,Least fixed point of a functor, J. Comp. Syst. Sciences19 (1979), 163–178.

    Article  MATH  Google Scholar 

  • [AK5]J. Adámek andV. Koubek,Are colimits of algebras simple to construct?, to appear in J. Algebra.

  • [AKP]J. Adámek, V. Koubek, andV. Pohlová,Colimits in the generalized algebraic categories, Acta Univ. Carolinae13 (1972), 29–40.

    Google Scholar 

  • [AT]J. Adámek, andV. Trnková,Recognizable and Regular Languages in a Category, Lect. Notes Comp. Sci.56 (Fundamentals of Comp. Theory), Springer-Verlag 1977, 206–211.

    MATH  Google Scholar 

  • [K1]V. Koubek,Set functors, Comment. Math. Univ. Carolinae12 (1971), 175–195.

    MATH  MathSciNet  Google Scholar 

  • [K2]V. Koubek,Set functors II-contravariant case, Comment. Math. Univ. Carolinae14 (1973), 47–59.

    MATH  MathSciNet  Google Scholar 

  • [KP]V. Koubek andP. Pták,On limits in the generalized algebraic properties-contravariant case, Acta Univ. Carolinae18, (1977), 43–53.

    MATH  Google Scholar 

  • [KR1]V. Koubek andJ. Reiterman,Set functors III-monomorphisms, epimorphisms, isomorphisms, Comment. Math. Univ. Carolinae14 (1973), 441–455.

    MATH  MathSciNet  Google Scholar 

  • [KR2]V. Koubek andJ. Reiterman,Factor categories of the category of sets: description and concreteness, J. Pure Appl. Algebra4 (1974), 71–77.

    Article  MATH  MathSciNet  Google Scholar 

  • [KR3]V. Koubek andJ. Reiterman,Automata and Categories-input processes, Lect. Notes in Comp. Sci. (Mathem. Foundations of Comp. Sci.), Springer-Verlag 1975, 280–286.

  • [KR4]V. Koubek andJ. Reiterman,A set functor which commutes with all homfunctors is a homfunctor, Czech. Math. J.26 (1976), 183–191.

    MATH  MathSciNet  Google Scholar 

  • [KR5]V. Koubek andJ. Reiterman,Categorial constructions of free algebras, colimits and completion of partial algebras, J. Pure Appl. Algebra14 (1979), 195–231.

    Article  MATH  MathSciNet  Google Scholar 

  • [KPK]V. K⫲rková-Pohlová andV. Koubek,When a generalized algebraic category is monadic, Comment. Math. Univ. Carolinae15 (1975), 577–587.

    Google Scholar 

  • [P]V. K⫲rková-Pohlová,On sums in generalized algebraic categories, Czech. Math. J.23 (98), 1973, 235–251.

    Google Scholar 

  • [Pt]P. Pták,On equalizers in generalized algebraic categories, Comment. Math. Univ. Carolinae13 (1972), 351–375.

    MATH  MathSciNet  Google Scholar 

  • [R1]J. Reiterman,An example concerning set-functors, Comment. Math. Univ. Carolinae12 (1971), 227–233.

    MATH  MathSciNet  Google Scholar 

  • [R2]J. Reiterman,A more categorical model of universal algebra, Lect. Notes in Comp. Sci.56 (Fundamentals in Comp. Theory), Springer-Verlag 1977, 308–313.

    MATH  MathSciNet  Google Scholar 

  • [R3]J. Reiterman,One more categorical model of universal algebra, Math. Z.161 (1978), 137–146.

    Article  MATH  MathSciNet  Google Scholar 

  • [R4]J. Reiterman,A left adjoint construction related to free triples, J. Pure Appl. Algebra10 (1977/78), 51–71.

    Article  MathSciNet  Google Scholar 

  • [R5]J. Reiterman,Large algebraic theories with small algebras, Bull. Austral. Math. Soc.19 (1978), 371–380.

    MATH  MathSciNet  Google Scholar 

  • [R6]J. Reiterman,A note to ADJ's subset systems, Proc. “Fund. Computation Theory”, Mathem. Forschung Bd. 2, Akademie-Verlag, Berlin 1979, 387–390.

    Google Scholar 

  • [T1]V. Trnková,Some properties of set functors, Comment. Math. Univ. Carolinae10 (1969), 323–352.

    MATH  MathSciNet  Google Scholar 

  • [T2]V. Trnková,On descriptive classification of set functors I., Comment. Math. Univ. Carolinae12 (1971), 143–175.

    MATH  MathSciNet  Google Scholar 

  • [T3]V. Trnková,On descriptive classification of set functors II., Comment. Math. Univ. Carolinae12 (1971), 345–357.

    MATH  MathSciNet  Google Scholar 

  • [T4]V. Trnková,On minimal realizations of behavior maps in categorial automata theory, Comment. Math. Univ. Carolinae15 (1974), 555–566.

    MATH  MathSciNet  Google Scholar 

  • [T5]V. Trnková,Automata and categories, Lect. Notes in Comp. Sci.32 (Math. Foundations of Comp. Sci.), Springer-Verlag 1975, 138–152.

  • [T6]V. Trnková,Minimal realizations for finite sets in categorial automata theory, Comment. Math. Univ. Carolinae16 (1975), 21–35.

    MATH  MathSciNet  Google Scholar 

  • [T7]V. Trnková,Relational Automata in a Category and their Languages, Lect. Notes in Comp. Sci.56 (Fundamentals of Comp. Theory), Springer-Verlag, 1977, 340–355.

    MATH  Google Scholar 

  • [T8]V. Trnková,General Theory of Relational Automata, Fund. Informaticae III (1979), 189–233.

    Google Scholar 

  • [T9]V. Trnková,Machines and their behaviour, Proc. “Second workshop meeting on categorical and algebraic methods in computer science and system theory” Forschungsbericht74, University Dortmund 1978, 110–115.

    MATH  Google Scholar 

  • [T10]V. Trnková,Behaviour of machines in categories, Comment. Math. Univ. Carolinae20 (1979), 267–282.

    MATH  Google Scholar 

  • [T11]V. Trnková,L-Fuzzy Functorial Automata, Math. Found. Comp. Scie. (MFCS' 79), Lect. Notes in Comp. Sci.74 (1979), Springer-Verlag, 463–473.

    MATH  Google Scholar 

  • [T12]V. Trnková,Machines and their behaviour in a category, Proc. “Fund. Comp. Theory (FCT' 79),” Math. Forschung Bd. 2., Akademie-Verlag, Berlin 1979, 450–461.

    Google Scholar 

  • [TA1]V. Trnková andJ. Adámek,On languages accepted by machines in the category of sets, Lect. Notes in Comp. Sci.53 (Math. Foundation of Comp. Sci.), Springer-Verlag 1977, 523–531.

    MATH  Google Scholar 

  • [TA2]V. Trnková andJ. Adámek,Redlization is not universal, Vorträge zur Automatentheorie, Weiterbildungszentrum für mathematische Kybernetik und Rechentechnik, Technische Universität, Dresden, Heft21 (1977), 38–55.

    Google Scholar 

  • [TA3]V. Trnková andJ. Adámek,Analyses of languages accepted by varietor machines in a category, to appear.

  • [TA4]V. Trnková andJ. Adámek,Tree-group automata, Fund. Comp. Theory (FCT79), Math. Forschung Bd. 2, Akademie-Verlag, Berlin 1979, 462–468.

    Google Scholar 

  • [TAKR]V. Trnková, J. Adámek, V. Koubek andJ. Reiterman,Free algebras, input processes and free monads, Comment. Math. Univ. Carolinae16 (1975), 339–351.

    MATH  MathSciNet  Google Scholar 

  • [TG]V. Trnková andP. Goralčík,On products in generalized algebraic categories, Comment. Math. Univ. Carolinae10 (1969), 49–89.

    MATH  MathSciNet  Google Scholar 

Other References

  • H. Andréka andI. Németi,Applications of universal algebra in computer science-review, Preprint of the Hungarian Academy of Sciences, Budapest 1979.

  • M. A. Arbib,Free dynamics and algebraic semantics, Lect. Notes Comp. Sci.59, Springer-Verlag 1977, 212–227.

    MathSciNet  Google Scholar 

  • M. A. Arbib andE. G. Manes,Machines in a category, an expository introduction, Lect. Notes Comp. Sci.25, Springer-Verlag 1975.

  • M. A. Arbib andE. G. Manes,Adjoint machines, state behavior machines and duality, J. Pure Appl. Alg.6, (1975), 313–344.

    Article  MATH  MathSciNet  Google Scholar 

  • M. A. Arbib andE. G. Manes,Intertwined recursion, tree transformation and linear systems, Information and Control40 (1979), 144–180.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Barr,Coequalizers and free triples, Math. Z.116 (1970), 307–322.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Barr,Right exact functors, J. Pure Appl. Alg.5 (1974), 1–7.

    Article  Google Scholar 

  • G. Birkhoff andJ. D. Lipson,Heterogeneous algebras, J. Combinatorial Theory8 (1970), 115–113.

    MATH  MathSciNet  Google Scholar 

  • L. Budach andH.-J. Hoehnke, Automaten und Funktoren, Akademie-Verlag Berlin 1975.

    MATH  Google Scholar 

  • E. Dubuc,Free monoids, J. Alg.29 (1974), 208–228.

    Article  MATH  MathSciNet  Google Scholar 

  • H. Ehrig, K.-D. Kiermeier, H.-J. Kreowski, andW. Kùhnel,Universal theory of automata, Teubner Stuttgart, 1974.

    MATH  Google Scholar 

  • S. Eilenberg,Automata, languages and machines, Volume A, Academic Press, New York and London, 1974.

    Google Scholar 

  • S. Eilenberg andJ. B. Wright,Automata in general algebras, Information and Control11 (1967), 52–70.

    Article  MathSciNet  Google Scholar 

  • J. A. Goguen,Minimal realization of machines in closed categories, Bull. Amer. Math. Soc.78 (1972), 777–783.

    Article  MATH  MathSciNet  Google Scholar 

  • J. A. Goguen,Realization is universal, Math. Syst. Theory6 (1973), 359–374.

    Article  MATH  MathSciNet  Google Scholar 

  • G. Jarzembski,Algebras in the category of posets and applications in the theory of programming and languages, Preprint 1, Copernicus Univ., Torun 1978.

    Google Scholar 

  • F. E. J. Linton,Coequalizers in categories of algebras, Seminar on triples and categorical homology, Lect. Notes Math.80, Springer-Verlag 1969.

  • V. R. Pratt,Dynamic algebras: examples, constructions, applications, Massachusetts Institute of Technology, Laboratory for Computer Science, TM-138, 1979.

  • H. Schubert,Categories, Springer-Verlag, 1972.

  • J. W. Thatcher andJ. B. Wright,Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Syst. Theory2 (1968), 57–81.

    Article  MATH  MathSciNet  Google Scholar 

  • W. Tholen,General machines and concrete functors, Proc. “Fund. Comp. Theory” Mathematische Forschung2 Akademie-Verlag, Berlin 1979, 450–461.

    Google Scholar 

  • M. Wand,Fixed point constructions in order-enriched categories, Th. Comp. Sci.8 (1979), 13–30.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Wischnewski,On the equivalence of concepts in system theory I, Proc. “Fund. Comp. Theory” Mathematische Forschung2, Akademie-Verlag, Berlin 1979, 523–536.

    Google Scholar 

  • M. B. Smyth andC. D. Plotkin,The category theoretic solution of recursive domain equations, D. A. I. Report60, Univ. Edinburgh 1978.

Download references

Author information

Authors and Affiliations

  1. Technical University, Prague, Czechoslovakia

    J. Adámek & V. Trnková

  2. Charles University, Prague, Czechoslovakia

    J. Adámek & V. Trnková

Authors
  1. J. Adámek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Trnková
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adámek, J., Trnková, V. Varietors and machines in a category. Algebra Universalis 13, 89–132 (1981). https://doi.org/10.1007/BF02483826

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02483826

Keywords

Search

Navigation