Skip to main content
SpringerLink
Log in

Der Moore-Automat (MrA)

  • Chapter
Automatentheorie

Part of the book series: Leitfäden und Monographien der Informatik ((LMI))

  • 124 Accesses

Zusammenfassung

Zur Einführung betrachten wir ein vereinfachtes Beispiel aus dem Gebiet der Programmiersprachen. Zum Verständnis ist es nötig, daß dem Leser der Gebrauch der metalinguistischen “Formeln” der Backus-Naur-Form (wie im ALGOL 60-Bericht eingeführt) vertraut ist. Notfalls schlage man in der angegebenen Literatur nach).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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.

Literatur zu 3

  • B.H. Barnes, J.M. Fitzgerald: Minimal experiments for input-independent machines, J.Assoc.Comput.Mach. 14 (1967) 683–686.

    Article  MATH  Google Scholar 

  • A.S. Bloch: Über Probleme, die mit sequentiellen Maschinen gelöst werden, Probleme der Kybernetik 3, Akademie-Verlag, Berlin 1963, 93–100 (Übersetzung aus dem Russischen, Original 1960 ).

    Google Scholar 

  • W.J. Cadden: Equivalent sequential circuits, IRE Trans. on Circuit Theory, CT-6 (1959) 30–34.

    Google Scholar 

  • J.H. Conway: Regular Algebra and Finite Machines, Chapman and Hall, London 1971.

    MATH  Google Scholar 

  • M. Depeyrot, J.P. Marmorat, J. Mondelli: An automaton-theoretic approach to the fast Fourier transform; in J. Fox (eds.), Computers and Automata, Microwave Research Inst.Symposia Series 21, Polytechnic Press of the Polytechnic Inst.of Brooklyn, N.Y., 1971, 359–377.

    Google Scholar 

  • S. Even: Rational numbers and regular events, IEEE Trans. on Electronic Computers EC-13 (1964) 740–741.

    Google Scholar 

  • A. Gill: Comparison of finite-state Models, IRE Trans. on Circuit Theory CT-7 (1960) 178–179.

    Google Scholar 

  • A. Gill: State identification experiments in finite automata, Inf. and Control 4 (1961) 132–154.

    Article  MATH  Google Scholar 

  • S. Ginsburg: Compatibility of states in input-independent machines, J.Assoc.Comput.Mach. 8 (1961) 400–403.

    Article  MathSciNet  MATH  Google Scholar 

  • T.N. Hibbard: Least upper bounds on minimal terminal state experiments for two classes of sequential machines, J.Assoc. Comput.Mach. 8 (1961) 601–612.

    Article  Google Scholar 

  • O.H. Ibarra: On the equivalence of finite-state sequential machine models, IEEE Trans. on Electronic Computers EC-16 (1967) 88–90.

    Google Scholar 

  • E.F. Moore: Gedanken-Experiments on sequential machines; in C.E.Shannon, J.McCarthy, Automata Studies, Ann.Math. Studies 34, Princeton University Press, Princeton 1956, 129–153, Deutsche Übersetzung in: C.E.Shannon, J.McCarthy, Studien zur Theorie der Automaten, Rogner und Bernhard, München 1974, 151–179.

    Google Scholar 

  • H.-J. Schneider: Compiler - Aufbau und Arbeitsweise, W. de Gruyter, Berlin 1975.

    MATH  Google Scholar 

  • M.A. Spivak: Minimization of a Moore automaton, Cybernetics 3 (1967) 4–5.

    Article  MathSciNet  Google Scholar 

  • P. Starke: Über Experimente an Automaten, Zeitschrift f.Mathem. Logik u.Grundlagen der Mathem. 13 (1967) 67–80.

    Article  MathSciNet  MATH  Google Scholar 

  • R. Valk: Minimal machines with several initial states are not unique, Inf. and Control 31 (1976) 193–196.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Hamburg, Hamburg, Deutschland

    Prof. Dr. rer. nat. Wilfried Brauer (Professor)

Authors
  1. Prof. Dr. rer. nat. Wilfried Brauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1984 B. G. Teubner, Stuttgart

About this chapter

Cite this chapter

Brauer, W. (1984). Der Moore-Automat (MrA). In: Automatentheorie. Leitfäden und Monographien der Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-92151-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-92151-2_3

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-519-02251-0

  • Online ISBN: 978-3-322-92151-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation