Skip to main content
SpringerLink
Log in

Products of Automata

  • Book
  • © 1986

Overview

Authors:
  1. Ferenc Gécseg

    1. József Attil Tundományegyetem Bolyai Intézete, Szeged, Hungary

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS, volume 7)

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Basic Concepts and Preliminaries

    • Ferenc Gécseg
    Pages 1-22

  3. Homomorphic Representations

    • Ferenc Gécseg
    Pages 23-60

  4. Isomorphic Representations

    • Ferenc Gécseg
    Pages 61-74

  5. Generalized Products and Simulations

    • Ferenc Gécseg
    Pages 75-92

  6. Representation of Automaton Mappings in Finite Length. Infinite Products

    • Ferenc Gécseg
    Pages 93-99

  7. Back Matter

    Pages 103-107
    Download chapter PDF
Back to top

Keywords

About this book

Both theoretical and practical considerations motivate the repre­ sentation of objects as certain compositions of simpler ones. In the theory of automata this observation has led to the concepts of pro­ ducts and complete systems of automata. In the general form of the products of automata all the component automata are fed back to one another. With this very broad notion of products, the realization of automata with large numbers of states by means of compositions of basic components is a highly involved process; this increases the possibility of errors. In order to decrease the complexity of feedbacks, a hierarchy of products called lXi-pro­ ducts was introduced some 10 years ago, where i runs over the set of all non-negative integers. In an IXcproduct the index set of the component automata is linearly ordered. The input of each automaton in the product may depend on the states of all automata preceding it, i. e. , all component automata steer all those automata which follow them in the product. Furthermore, at most the next i-I automata (including itself) may be fed back to the input of a given component automaton. Thus for iXcproducts the lengths of feedbacks are at most i. The aim of this monograph is to give a systematic account of iXi-Products. It consists of five chapters, a reference section, and an index. The first chapter contains the necessary concepts and results from universal algebra, automata, and sequential machines.

Authors and Affiliations

  • József Attil Tundományegyetem Bolyai Intézete, Szeged, Hungary

    Ferenc Gécseg

Bibliographic Information

  • Book Title: Products of Automata

  • Authors: Ferenc Gécseg

  • Series Title: Monographs in Theoretical Computer Science. An EATCS Series

  • DOI: https://doi.org/10.1007/978-3-642-61611-2

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Haidelberg 1986

  • Softcover ISBN: 978-3-642-64884-7Published: 05 October 2011

  • eBook ISBN: 978-3-642-61611-2Published: 06 December 2012

  • Series ISSN: 1431-2654

  • Series E-ISSN: 2193-2069

  • Edition Number: 1

  • Number of Pages: VIII, 108

  • Topics: Computation by Abstract Devices

Publish with us

Policies and ethics

Back to top

Search

Navigation