TRANSFORMATION SEMIGROUP OF THE FINITE AUTOMATA AND ITS RECOGNIZATION INFORMATION
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

O233

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In the analysis and cotnriol of sequencense system, We Want to know the behaviour of the systen, i.e what information ( or input) applied to the system can reach expected state ( or output ) . This problem is concerned with the recognization problem of the finite automata. A way to use (0,1 )-matrix to calculate this transf rmation semigroup of the finite automata and its recognization information is proposed, and variour specific (0, 1 ) -matrix represents information is analyzed in this paper.

    Reference
    Related
    Cited by
Get Citation

周德玉.有限自动机的变换半群和它识别的信息[J].重庆大学学报,1989,12(1):98~104

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code