IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-8853-1_5.html
   My bibliography  Save this book chapter

Regular Canonical Systems

In: Finite Automata, Their Algebras and Grammars

Author

Listed:
  • J. Richard Büchi

    (Purdue University, Computer Science Department)

  • Dirk Siefkes

    (Technische Universität Berlin, Fachbereich Informatik)

Abstract

In chapter 4 we have generalized finite automata to a wider class of structures, finite transition systems, and we have extended the run method to extend the notion of behavior. Via subset construction we showed this larger class of structures to still have periodic behavior only. Such results are useful; they provide additional freedom to describe periodic sets, that is, automata behavior. Stated differently, to show that an event is periodic it suffices to show it to be definable by a transition system. We made use of this freedom in section 4.4, to show that regular events are periodic. In this chapter we will find a large extension of finite transition systems to structures we call regular canonical systems. To extend the notion of behavior adequately, we will have to abandon the run idea. Its place will be taken by the notion of a formal deduction (or proof), which plays a central role in modern logic and linguistics.

Suggested Citation

  • J. Richard Büchi & Dirk Siefkes, 1989. "Regular Canonical Systems," Springer Books, in: Dirk Siefkes (ed.), Finite Automata, Their Algebras and Grammars, chapter 0, pages 180-216, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-8853-1_5
    DOI: 10.1007/978-1-4613-8853-1_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4613-8853-1_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.