Skip to main content

Minimization Concepts of Automata in Pseudoclosed Categories

  • Conference paper
Mathematical Systems Theory

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 131))

  • 156 Accesses

Abstract

In this paper starting in section 1 with a review of the basic notions and constructions of automata in pseudoclosed categories as given in /Eh-Kr 73/ and /Eh-K3 74/, in section 2 we give an improved approach to minimization of automata in closed categories based on a terminal object in the category of automata, we build up a hierarchy of minimization concepts and give a characterization of minimal automata in the pseudo-closed case in section 3, and finally in section 4 an algorithm for the scoop minimization of nondeterministic automata and some open problems are formulated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.A. Arbib, E.G. Manes: Adjoint Machines. State-Behavior and Duality, Techn. Rep. 73B-1COINS, Univ. of Mass. at Amherst (1973), to appear in J. Pure Appl. Alg.

    Google Scholar 

  2. M.A. Arbib, E.G. Manes: Fuzzy morphisms in automata theory, Lecture Notes in Comp.Sci. 25, 80–86. (1975)

    Article  MathSciNet  Google Scholar 

  3. E.S. Bainbridge: A Unified Minimal Realization Theory, with Duality for Machines in a Hyperdoc-trine (Announcement of Results), Techn.Rep.,Comp. and Comm.Sci.Dept.,Univ. of Michigan (1972). 3

    Google Scholar 

  4. H. Ehrig, K.-D. Kiermeier, H.-J. Kreowski,W. Kühnel: Universal Theory of Automata, Teubner, Stuttgart 1974

    MATH  Google Scholar 

  5. H. Ehrig, H.-J. Kreowski: Systematic Approach of Reduction and Minimization in Automata and System Theory, Forschungsbericht 73–16 (1973), FB 20 der TU Berlin, to appear in revised version in: J. Comp.Syst. Sci.

    Google Scholar 

  6. H. Ehrig, H.-J. Kreowski: Power and initial automata in pseudoclosed categories, in Lecture Notes in Comp.Sci. 25, 144–150.

    Google Scholar 

  7. J.A. Goguen: Discrete-Time-Machines in Closed Monoidal Categories I, Quarterly Rep. no. 30, Inst. f. Comp.Res., Univ. of Chicago (1971), condensed version in: Bull AMS 78 (1972), 777–783

    Google Scholar 

  8. E.G. Manes: Nondeterminism, preprint, Univ. of Mass. (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Kreowski, HJ., Ehrig, H. (1976). Minimization Concepts of Automata in Pseudoclosed Categories. In: Marchesini, G., Mitter, S.K. (eds) Mathematical Systems Theory. Lecture Notes in Economics and Mathematical Systems, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48895-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48895-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07798-5

  • Online ISBN: 978-3-642-48895-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics