Computation and Automata

Saved in:
Bibliographic Details
Title: Computation and Automata
Description: In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.
Authors: Arto Salomaa
Resource Type: eBook.
Subjects: Sequential machine theory, Computable functions, Computational complexity
Categories: MATHEMATICS / General
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 570392
RelevancyScore: 959
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 959.155151367188
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$570392$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$570392$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Computation and Automata
– Name: Abstract
  Label: Description
  Group: Ab
  Data: In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Arto+Salomaa%22">Arto Salomaa</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Sequential+machine+theory%22">Sequential machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computable+functions%22">Computable functions</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+General%22">MATHEMATICS / General</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=570392
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 511
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Sequential machine theory
        Type: general
      – SubjectFull: Computable functions
        Type: general
      – SubjectFull: Computational complexity
        Type: general
    Titles:
      – TitleFull: Computation and Automata
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Arto Salomaa
      – PersonEntity:
          Name:
            NameFull: Arto Salomaa
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 1985
            – D: 04
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9780521302456
            – Type: isbn-electronic
              Value: 9781107087583
          Numbering:
            – Type: volume
              Value: 00025
          Titles:
            – TitleFull: Computation and Automata
              Type: main
ResultId 1