Skip to main content
SpringerLink
Log in

Some logical problems connected with a modular decomposition theory of automata

  • Conference paper
  • First Online:
Computation and Proof Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1104))

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
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.

6. References

  1. Brüggemann, A.: Personal communication

    Google Scholar 

  2. Brüggemann, A./Priese, L./ Rödding, D./ Schätz, R.: Modular Decomposition of Automata. In: Börger, E./ Hasenjäger, G./ Rödding, D. (eds), Proceedings of the Symposium "Rekursive Kombinatorik", Münster 1983. To appear in LNCS (1984)

    Google Scholar 

  3. Kniza, K.-P.: Automaten und rekursive Funktionale endlichen Typs, Dissertation, Inst. f. math. Logik und Grundlagenforschung, Münster 1980

    Google Scholar 

  4. Kleine Büning, H.: Complexity of Loop-Problems in Normed Networks. In: Börger, E./ Hasenjäger, G./ Rödding, D. (eds.), Proceedings of the Symposium "Rekursive Kombinatorik", Münster 1983. To appear in LNCS (1984)

    Google Scholar 

  5. Körber, P./ Ottmann, Th.: Simulation endlicher Automaten durch Ketten aus einfachen Bausteinautomaten. EIK lo (1974)

    Google Scholar 

  6. Körber, P.: Untersuchungen an sequentiellen, durch normierte Konstruktionen gewonnenen Netzwerken endlicher Automaten. Dissertation, Inst. f. math. Logik und Grundlagenforschung, Münster 1976

    Google Scholar 

  7. Ottmann, Th.: Über Möglichkeiten zur Simulation endlicher Automaten durch eine Art sequentieller Netzerke aus einfachen Bausteinen. ZmLG 19 (1973)

    Google Scholar 

  8. Ottmann, Th.: Arithmetische Prädikate über einem Bereich endlicher Automaten. Arch. math. Logik 16 (1974)

    Google Scholar 

  9. Ottmann, Th.: Eine einfache universelle Menge endlicher Automaten. ZmLG 24 (1978)

    Google Scholar 

  10. Rödding, D.: Modular Decomposition of Automata (Survey). in: Karpinski, M. (ed.), Proceedings of the 1983 International FCT-Conference, LNCS 158

    Google Scholar 

  11. Vobl, R.: Komplexitätsuntersuchungen an Basisdarstellungen endlicher Automaten. Diplomarbeit, Inst. f. math. Logik und Grundlagenforschung, Münster (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematische Logik und Grundlagenforschung, Einsteinstraße 62, D-4400, Münster

    Dieter Rödding

Authors
  1. Dieter Rödding
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Walter Oberschelp Michael M. Richter Brigitta Schinzel Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Rödding, D. (1984). Some logical problems connected with a modular decomposition theory of automata. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099492

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13901-0

  • Online ISBN: 978-3-540-39119-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation