• DocumentCode
    1104409
  • Title

    General Repetitive Events and Machines

  • Author

    Reynolds, B.G.

  • Issue
    2
  • fYear
    1970
  • Firstpage
    167
  • Lastpage
    169
  • Abstract
    A finite automaton is a general repetitive machine if there is a path in the state graph from every final state to the start state. In this paper general repetitive events are defined in terms of certain factorization properties of the associated regular expressions, and a one-to-one onto correspondence is shown between general repetitive machines and general repetitive events.
  • Keywords
    Automaton, finite automaton, general repetitive event, general repetitive machine, repetitive event, repetitive machine.; Automata; Instruments; Terminology; Automaton, finite automaton, general repetitive event, general repetitive machine, repetitive event, repetitive machine.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1970.222887
  • Filename
    1671480
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1104409