Skip to main content
  • Textbook
  • © 1978

Automata-Theoretic Aspects of Formal Power Series

Part of the book series: Monographs in Computer Science (MCS)

Buy it now

Buying options

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

Other ways to access

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

Table of contents (4 chapters)

  1. Front Matter

    Pages i-x
  2. Introduction

    • Arto Salomaa, Matti Soittola
    Pages 1-15
  3. Rational series

    • Arto Salomaa, Matti Soittola
    Pages 16-75
  4. Applications of rational series

    • Arto Salomaa, Matti Soittola
    Pages 76-117
  5. Algebraic series and context-free languages

    • Arto Salomaa, Matti Soittola
    Pages 118-162
  6. Back Matter

    Pages 163-174

About this book

This book develops a theory of formal power series in noncommuting variables, the main emphasis being on results applicable to automata and formal language theory. This theory was initiated around 196O-apart from some scattered work done earlier in connection with free groups-by M. P. Schutzenberger to whom also belong some of the main results. So far there is no book in existence concerning this theory. This lack has had the unfortunate effect that formal power series have not been known and used by theoretical computer scientists to the extent they in our estimation should have been. As with most mathematical formalisms, the formalism of power series is capable of unifying and generalizing known results. However, it is also capable of establishing specific results which are difficult if not impossible to establish by other means. This is a point we hope to be able to make in this book. That formal power series constitute a powerful tool in automata and language theory depends on the fact that they in a sense lead to the arithmetization of automata and language theory. We invite the reader to prove, for instance, Theorem IV. 5. 3 or Corollaries III. 7. 8 and III. 7.- all specific results in language theory-by some other means. Although this book is mostly self-contained, the reader is assumed to have some background in algebra and analysis, as well as in automata and formal language theory.

Authors and Affiliations

  • Department of Mathematics, University of Turku, Turku 50, Finland

    Arto Salomaa, Matti Soittola

Bibliographic Information

  • Book Title: Automata-Theoretic Aspects of Formal Power Series

  • Authors: Arto Salomaa, Matti Soittola

  • Series Title: Monographs in Computer Science

  • DOI: https://doi.org/10.1007/978-1-4612-6264-0

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag New York Inc. 1978

  • Softcover ISBN: 978-1-4612-6266-4Published: 23 October 2011

  • eBook ISBN: 978-1-4612-6264-0Published: 06 December 2012

  • Series ISSN: 0172-603X

  • Series E-ISSN: 2512-5486

  • Edition Number: 1

  • Number of Pages: 171

  • Topics: Computer Science, general

Buy it now

Buying options

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

Other ways to access