On languages, accepted by machines in the category of sets

  • Věra Trnková
  • Jiří Adámek
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Input Process Regular Language Finite Automaton Regular System Star Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arbib M. A., Manes E. G., Machines in a category, an expository introduction. SIAM Review 16(1974), 163–192.CrossRefGoogle Scholar
  2. 2.
    Thatcher J.W., Wright J.B., Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory 2(1968), 57–81.CrossRefGoogle Scholar
  3. 3.
    Brainerd W.S., Tree generating regular systems. Information and Control 14(1969), 217–231.CrossRefGoogle Scholar
  4. 4.
    Trnková V., On minimal realizations of behavior maps in categorial automata theory, Comment.Math.Univ.Carolinae 15(1975), 555–566.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Věra Trnková
    • 1
  • Jiří Adámek
    • 2
  1. 1.Charles UniversityPraha 8Czechoslovakia
  2. 2.Technical UniversityPraha 6Czechoslovakia

Personalised recommendations