Accession Number : AD0666696

Title :   REGULAR EXPRESSIONS AND CHECKING EXPERIMENTS,

Corporate Author : POLYTECHNIC INST OF BROOKLYN N Y MICROWAVE RESEARCH INST

Personal Author(s) : Gelenbe,S. Erol

Report Date : SEP 1967

Pagination or Media Count : 54

Abstract : The paper reviews the theory of regular expressions and focuses some attention on their use for the representation of the state behaviour of sequential machines. A brief review of diagnostics making use of distinguishing sequences for the design of text experiments for strongly connected machines follows. These principles are then applied to the systematic design of present checking experiments for which two design methods are proposed. Both these methods involve the solution of n-simultaneous regular equations. An upper bound to the length of the experiments is formulated. The length of the experiments designed in the fashion is seen to be of the same order of magnitude but generally somewhat longer than the length which would be obtained by the other methods on the same principles which have appeared in the literature. (Author)

Descriptors :   (*LEARNING MACHINES, AUTOMATA), (*MATHEMATICAL LOGIC, AUTOMATA), (*ARTIFICIAL INTELLIGENCE, AUTOMATA), GROUPS(MATHEMATICS), SET THEORY, SIMULTANEOUS EQUATIONS, MATRICES(MATHEMATICS), THEOREMS, THESES

Subject Categories : Operations Research
      Bionics

Distribution Statement : APPROVED FOR PUBLIC RELEASE