Skip to main content
SpringerLink
Log in

Der Rabin-Scott-Automat

  • Chapter
Automatentheorie

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

  • 124 Accesses

Zusammenfassung

Bei vielen Untersuchungen des Verhaltens von Maschinen, Prozessen oder Algorithmen interessiert nur, unter welchen Umständen, ausgehend von gewissen (Start-)Zuständen, bestimmte (End-)Zustände erreicht werden können. In diesen Fällen ist es unnötig, das Modell eines Automaten mit Ausgabe zu benutzen. Ferner müssen nicht notwendig die Wirkungen aller Aktionen eindeutig festgelegt sein, wenn nur die Möglichkeit untersucht werden soll, ob bestimmte Zustände erreicht werden können. Dazu ein Beispiel, das mit Problemen der Betriebsmittelvergabe in Rechnersystemen zusammenhängt, und ein Beispiel aus der Programmierung.Zwei weitere Beispiele sollen zeigen, daß es oft recht einfach und praktisch ist, Lösungsverfahren als nichtdeterministische Algorithmen anzugeben — diese knnen dann entweder (in ganz systematischer Weise) in deterministische Algorithmen umgewandelt oder auf Rechnern mit Parallelverarbeitungsmöglichkeit direkt ausgeführt werden.

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 5

  • D. Allen, Jr., On a characterization of the nonregular set of primes, J. Computer and System Sciences 2, (1968), 464–467.

    Article  MATH  Google Scholar 

  • D.N. Arden, Delayed-logic and finite-state machines, in Theory of Computing Machine Design, Univers.of Michigan Press

    Google Scholar 

  • Ann Arbor, Mich., 1960, 1–35 und in: Proc. 2nd Ann.Symp.on Switching Circuit Theory and Logical Design, Detroit, 1961, 133–151.

    Google Scholar 

  • Y. Bar-Hillel, M. Perles, E. Shamir, On formal properties of simple phrase structure grammars, Zeitschr.f.Phonetik, Sprachwissenschaft und Kommunikationsforschung 14 (1961) 143–172.

    MathSciNet  MATH  Google Scholar 

  • B.H. Barnes, A programmer’s view of automata, Computing Surveys 4, (1972), 221–239.

    Article  MATH  Google Scholar 

  • J. Berstel, Ensembles reconnaissables des nombres, Institut de Programmation, Université Paris VI, Prépubl.No.I.P.73.19, Paris 1973 und in:

    Google Scholar 

  • J.-P. Crestin, M. Nivat (Hrsgb): Langages Algébriques, Actes des premières journées d’informatique théorique, Bonascre 1973, Ecole Nat.Sup.de Techniques Avancées, Paris, 1973.

    Google Scholar 

  • V.G. Bodnarchuk, Gleichungssysteme in der Algebra der Ereignisse, J.f.Numer.Mathe.u.Mathem.Physik 3, (1963), 1077–1088 (in russischer Sprache - vgl. Mathem.Reviews 29, Nr.15)

    Google Scholar 

  • W. Brauer, Zur Bestimmung der maximalen Untergruppen des Transitionsmonoids eines Automaten, EIK 7, (1971), 251–260.

    MathSciNet  MATH  Google Scholar 

  • A.K. Chandra, On the properties and Applications of Program Schemas, Ph.D.Thesis, Computer Science Dept., Stanford Univers., Report No. STAN-CS. 73–336, 1973.

    Google Scholar 

  • N. Chomsky, G.A. Miller, Finite state languages, Inform. and Control 1, (1958), 91–112.

    Article  MathSciNet  MATH  Google Scholar 

  • N. Chomsky, M.P. Schützenberger, The algebraic theory of context-free languages, in P. Brafford, D. Hirschberg (eds.), Computer Programming and Formal Systems, North-Holland, Amsterdam, 1963, 118–161.

    Chapter  Google Scholar 

  • I.M. Copi, C.C. Elgot, J.B. Wright, Realization of events by logical nets, J.Assoc.Comput.Mach. 5, (1958), 181–196.

    Article  MathSciNet  MATH  Google Scholar 

  • F.G. Cousineau, J.-F. Perrot, J.M. Rifflet, APL Programs for direct computation of a finite semigroup, in P. Gjerlolf

    Google Scholar 

  • H.J. Helms, J. Nielsen (eds), APL Congress 73, North-Holland, Amsterdam, 1973, 67–74.

    MATH  Google Scholar 

  • J.P. Deschamps, Asynchronous automata and asynchronous languages, Inf. and Control 24, (1974), 122–143.

    Article  MathSciNet  MATH  Google Scholar 

  • G. Dittrich, Analogon zum Kleeneschen Satz für asynchrone Automaten, Seminarber.Inst.f.Theorie d.Autom.u.Schaltnetzwerke 12, Gesellsch.f.Mathematik u.Datenverarbeitung, Bonn 1969.

    Google Scholar 

  • S. Eilenberg, Algèbre catégorique et théorie des automates, Cours donna à l’Institut H.Poincara, rédigé par R.Roussariè, Paris, 1967.

    Google Scholar 

  • S. Eilenberg, M.P. Schützenberger, Rational Sets in Commutative Monoids, J.Algebra 13, (1969), 173–191.

    Article  MathSciNet  MATH  Google Scholar 

  • C.C. Elgot, J.D. Rutledge, Operations on finite automata, in: Proc.Second Ann.Symp.Switching Circuit Theory and Logical Design, Detroit, 1961, 129–132.

    Google Scholar 

  • S. Ginsburg, Sets of tapes accepted by different types of automata, J.Assoc.Comput.Mach. 8, (1961), 81–86.

    Article  MathSciNet  MATH  Google Scholar 

  • S. Ginsburg, E.H. Spanier, Quotients of Context-Free Languages, J.Assoc.Comput.Mach. 10, (1963), 487–492.

    Article  MathSciNet  MATH  Google Scholar 

  • A. Ginzburg, A procedure for checking equality of regular expressions, J.Assoc.Comput.Mach. 14, (1967), 355–362.

    Article  MATH  Google Scholar 

  • W.M. Gluschkow, Gewisse Probleme der Synthese von Digitalrechnern, J.f.Numer.Mathem.u.Mathem.Physik 1, (1961), 371–411

    Google Scholar 

  • J. Hartmanis, H. Shank, On the recognition of primes by automata, J.Assoc.Comput.Mach. 15, (1968), 382–389.

    Article  MathSciNet  MATH  Google Scholar 

  • I.M. Havel, The theory of regular events I,II, Kybernetica Praha 5, (1969), 400–419, 520–544.

    Google Scholar 

  • I.M. Havel, Nondeterministically recognizable sets of languages, in J. Becvât (ed.), Mathematical Foundations of Computer Science 1975, Lecture Notes in Computer Science Vol. 32, Springer, Berlin 1975, 252–257.

    Google Scholar 

  • R.C. Holt, Some deadlock properties of Computer systems, Computing Surveys 4, (1972), 179–196.

    Article  MathSciNet  Google Scholar 

  • K. Jensen, N. Wirth, PASCAL,User Manual and Report, 2nd Edition, Lecture Notes in Computer Science 18, Springer, Berlin, 1975.

    Google Scholar 

  • S.C. Kleene, Representation of events in nerve sets and finite automata, in C.E. Shannon, J. McCarthy (eds.), Automata Studies, Ann.Math.Studies 34, Princeton Univers.Press, Princeton 1956, 3–41;

    Google Scholar 

  • C.E.Shannon, J.McCarthy, Studien zur Theorie der Automaten, Rogner und Bernhard, München, 1974, 3–55.

    Google Scholar 

  • A. Lentin, Equations dans les monoides libres, Gauthier-Villars, Paris, 1972.

    MATH  Google Scholar 

  • R.C. Lyndon, M.P. Schützenberger, The equation am = bncP in a free group, Michigan Math.J. 9, (1962), 289–298.

    Article  MathSciNet  MATH  Google Scholar 

  • Z. Manna, Mathematical Theory of Computation, McGraw-Hill, New York, 1974.

    MATH  Google Scholar 

  • W.S. McCulloch, W. Pitts, A logical calculus of the ideas immanent in nervous activity, Bulletin of Mathematical Biophysics 5, (1943), 115–133.

    Article  MathSciNet  MATH  Google Scholar 

  • R. McNaughton, H. Yamada, Regular expressions and state graphs for automata, IRE Trans.on Electronic Computers EC-9, (1960), 39–47.

    Google Scholar 

  • R. McNaughton, S. Papert, The syntactic monoid of a regular event, in M.A.Arbib (ed.), Algebraic Theory of Machines, Languages, and Semigroups, Academic Press, New York, 1968, 297–312.

    Google Scholar 

  • R. McNaughton, S. Papert, Counter-Free Automata, Research Monograph No 65, The M.I.T. Press, Cambridge, Mass. 1971.

    Google Scholar 

  • T. Medvedev, On a class of events representable in a finite automaton, Anhang zur russischen Übersetzung von: C.E.Shannon, J.McCarthy (eds.), Automata Studies, Publ.Agency for Foreign Literature, Moskau 1956;

    Google Scholar 

  • J.J.Schorr-Kon für Lincoln Lab.Rep., 34–73, 1958, abgedruckt in: E.F.Moore (ed.), Sequential Machines, Selected Papers, Addison-Wesley, Reading.Mass., 1964.

    Google Scholar 

  • A.R. Meyer, L. J. Stockmeyer, Word problems requiring exponential time, in Proc. 5th Ann.Symp.on Theory of Computing, 1973, 1–9.

    Google Scholar 

  • J.Myhill, Finite automata and the representation of events, Wright Air Devel.Command Techn.Rep. 57–624, (1957), 112–137.

    Google Scholar 

  • G.J. Nutt, Some applications of finite state automata theory to the deadlock problem, Colorado University, Boulder, Techn.Report CU-CS-017–73, 1973.

    Google Scholar 

  • G. Ott, N.H. Feinstein, Design of sequential machines from their regular éxpressions, J.Assoc.Comput.Mach. 8, (1961), 585–600.

    Article  MathSciNet  MATH  Google Scholar 

  • J.-F. Perrot, Sur le calcul effectif du monoide de transition d’un automata fini, in W.D.Itzfeld (Hrsgb.) International Computing Symposium 1970, Proceedings, Gesellsch.f.Mathematik und Datenverarbeitung, Bonn 1973, 664–672.

    Google Scholar 

  • M.O. Rabin, D. Scott, Finite automata and their decision problems, IBM J.Research and Development 3, (1959), 114–125;

    Article  MathSciNet  Google Scholar 

  • E.F.Moore (ed.), Sequential Machines, Addison-Wesley, Reading, Mass., 1964, 63–91; deutsche Übersetzung in: C.E.Shannon, J.McCarthy, Studien zur Theorie der Automaten, Rogner und Bernhard, München, 1974, 327–361.

    Google Scholar 

  • W. Reisig, Petrinetze - Eine Einführung, Springer, Berlin 1982. L. Richter, Betriebssysteme, Teubner, Stuttgart, 1977.

    Google Scholar 

  • R.W. Ritchie, Finite automata and the set of squares, J.Assoc.Comput.Mach. 10, (1963), 528–531.

    Article  MathSciNet  MATH  Google Scholar 

  • A. Salomaa, Axiom Systems for Regular Expressions of Finite Automata, Ann.Univers.Turku, Ser.AI, 75, Turku 1964.

    Google Scholar 

  • A. Salomaa, Two complete axiom systems for the algebra of regular events, J.Assoc.Comput.Mach. 13, (1966) 158–169.

    Article  MathSciNet  MATH  Google Scholar 

  • M.P. Schützenberger, On an application of semi-group methods to some problems in coding, IRE Trans.on Information Theory IT-2, (1956), 47–60.

    Google Scholar 

  • M.P. Schützenberger, Une théorie algébrique du codage, Séminaire Dubreil-Pisot, Faculté des Sciences Paris, Année 1955/56, Exposé No.15; sowie C.R.Acad.Sci. Paris 242, (1956), 862–864.

    Google Scholar 

  • M.P. Schützenberger, On context-free languages and push-down automata, Inf.and Control 6 (1963) 246–264.

    Article  MATH  Google Scholar 

  • J.I. Seiferas, R. McNaughton, Regularity-preserving relations, Theor.Comp.Science 2 (1976) 147–154.

    Article  MathSciNet  MATH  Google Scholar 

  • I. Simon, Piecewise testable events, in H.Brakhage, Automata Theory and Formal Languages, 2nd GI Conference, Lecture Notes in Computer Scinece 33, Springer-Verlag, Berlin, 1975, 214–222.

    Google Scholar 

  • R.E. Stearns, J. Hartmanis, Regularity preserving modification of regular expressions, Inf.and Control 6, (1963), 55–69.

    Article  MathSciNet  MATH  Google Scholar 

  • H.-G. Stork, Ein automatentheoretisches Modell einer Speicherhierarchie, in Lecture Notes in Comp.Science 2, Springer, Berlin 1973, 98–103.

    Google Scholar 

  • T. Urponen, On Axiom Systems for Regular Expressions and on Equations Involving Languages, Ann.Univers.Turku, Ser.AI, 145, Turku 1971

    Google Scholar 

  • C.C. Yang, On the modeling of demand paging algorithmes by finite automata, Ieee Trans.on Computers C-23, (1974) 870–874.

    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 Rabin-Scott-Automat. In: Automatentheorie. Leitfäden und Monographien der Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-92151-2_5

Download citation

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

  • 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