Automata-Theoretic Aspects of Formal Power Series View Full Text


Ontology type: schema:Book     


Book Info

DATE

1978

GENRE

Monograph

AUTHORS

Arto Salomaa , Matti Soittola

PUBLISHER

Springer Nature

ABSTRACT

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. More... »

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-1-4612-6264-0

DOI

http://dx.doi.org/10.1007/978-1-4612-6264-0

ISBN

978-1-4612-6266-4 | 978-1-4612-6264-0

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1046944411


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Mathematics, University of Turku, 20500, Turku 50, Finland", 
          "id": "http://www.grid.ac/institutes/grid.1374.1", 
          "name": [
            "Department of Mathematics, University of Turku, 20500, Turku 50, Finland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Salomaa", 
        "givenName": "Arto", 
        "id": "sg:person.07416013515.38", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07416013515.38"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Mathematics, University of Turku, 20500, Turku 50, Finland", 
          "id": "http://www.grid.ac/institutes/grid.1374.1", 
          "name": [
            "Department of Mathematics, University of Turku, 20500, Turku 50, Finland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Soittola", 
        "givenName": "Matti", 
        "id": "sg:person.012014015571.60", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012014015571.60"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1978", 
    "datePublishedReg": "1978-01-01", 
    "description": "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.", 
    "genre": "monograph", 
    "id": "sg:pub.10.1007/978-1-4612-6264-0", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isbn": [
      "978-1-4612-6266-4", 
      "978-1-4612-6264-0"
    ], 
    "keywords": [
      "formal power series", 
      "power series", 
      "formal language theory", 
      "theoretical computer scientists", 
      "language theory", 
      "mathematical formalism", 
      "specific results", 
      "free group", 
      "theory", 
      "formalism", 
      "main results", 
      "computer scientists", 
      "automata", 
      "main emphasis", 
      "algebra", 
      "powerful tool", 
      "arithmetization", 
      "estimation", 
      "Schutzenberger", 
      "existence", 
      "means", 
      "results", 
      "variables", 
      "point", 
      "instances", 
      "connection", 
      "series", 
      "tool", 
      "work", 
      "fact", 
      "unfortunate effect", 
      "book", 
      "emphasis", 
      "analysis", 
      "readers", 
      "scientists", 
      "aspects", 
      "lead", 
      "background", 
      "effect", 
      "extent", 
      "group", 
      "lack"
    ], 
    "name": "Automata-Theoretic Aspects of Formal Power Series", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1046944411"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-1-4612-6264-0"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-1-4612-6264-0", 
      "https://app.dimensions.ai/details/publication/pub.1046944411"
    ], 
    "sdDataset": "books", 
    "sdDatePublished": "2022-06-01T22:26", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/book/book_9.jsonl", 
    "type": "Book", 
    "url": "https://doi.org/10.1007/978-1-4612-6264-0"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-1-4612-6264-0'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-1-4612-6264-0'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-1-4612-6264-0'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-1-4612-6264-0'


 

This table displays all metadata directly associated to this object as RDF triples.

100 TRIPLES      21 PREDICATES      68 URIs      61 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-1-4612-6264-0 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author Nae2ad3935b954542bbd7014438ea4fb6
4 schema:datePublished 1978
5 schema:datePublishedReg 1978-01-01
6 schema:description 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.
7 schema:genre monograph
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isbn 978-1-4612-6264-0
11 978-1-4612-6266-4
12 schema:keywords Schutzenberger
13 algebra
14 analysis
15 arithmetization
16 aspects
17 automata
18 background
19 book
20 computer scientists
21 connection
22 effect
23 emphasis
24 estimation
25 existence
26 extent
27 fact
28 formal language theory
29 formal power series
30 formalism
31 free group
32 group
33 instances
34 lack
35 language theory
36 lead
37 main emphasis
38 main results
39 mathematical formalism
40 means
41 point
42 power series
43 powerful tool
44 readers
45 results
46 scientists
47 series
48 specific results
49 theoretical computer scientists
50 theory
51 tool
52 unfortunate effect
53 variables
54 work
55 schema:name Automata-Theoretic Aspects of Formal Power Series
56 schema:productId N3e6e6e6f26ba49aaa38f923d97cf2572
57 Nec8a2f02bb8846ba9be34ffdb1dfb2c4
58 schema:publisher N3988ea21c2c74bafb98f53fde5349c56
59 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046944411
60 https://doi.org/10.1007/978-1-4612-6264-0
61 schema:sdDatePublished 2022-06-01T22:26
62 schema:sdLicense https://scigraph.springernature.com/explorer/license/
63 schema:sdPublisher N7c694a39ee4d4e51bb0011576b231f58
64 schema:url https://doi.org/10.1007/978-1-4612-6264-0
65 sgo:license sg:explorer/license/
66 sgo:sdDataset books
67 rdf:type schema:Book
68 N1f12c57ee2414658bd000ecd669f4127 rdf:first sg:person.012014015571.60
69 rdf:rest rdf:nil
70 N3988ea21c2c74bafb98f53fde5349c56 schema:name Springer Nature
71 rdf:type schema:Organisation
72 N3e6e6e6f26ba49aaa38f923d97cf2572 schema:name doi
73 schema:value 10.1007/978-1-4612-6264-0
74 rdf:type schema:PropertyValue
75 N7c694a39ee4d4e51bb0011576b231f58 schema:name Springer Nature - SN SciGraph project
76 rdf:type schema:Organization
77 Nae2ad3935b954542bbd7014438ea4fb6 rdf:first sg:person.07416013515.38
78 rdf:rest N1f12c57ee2414658bd000ecd669f4127
79 Nec8a2f02bb8846ba9be34ffdb1dfb2c4 schema:name dimensions_id
80 schema:value pub.1046944411
81 rdf:type schema:PropertyValue
82 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
83 schema:name Mathematical Sciences
84 rdf:type schema:DefinedTerm
85 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
86 schema:name Pure Mathematics
87 rdf:type schema:DefinedTerm
88 sg:person.012014015571.60 schema:affiliation grid-institutes:grid.1374.1
89 schema:familyName Soittola
90 schema:givenName Matti
91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012014015571.60
92 rdf:type schema:Person
93 sg:person.07416013515.38 schema:affiliation grid-institutes:grid.1374.1
94 schema:familyName Salomaa
95 schema:givenName Arto
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07416013515.38
97 rdf:type schema:Person
98 grid-institutes:grid.1374.1 schema:alternateName Department of Mathematics, University of Turku, 20500, Turku 50, Finland
99 schema:name Department of Mathematics, University of Turku, 20500, Turku 50, Finland
100 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...