@article{oai:nuis.repo.nii.ac.jp:00002673,
 author = {Ishii, Tadao and Ishii, Tadao},
 journal = {新潟国際情報大学経営情報学部紀要},
 month = {Apr},
 note = {In this paper we will show how to define a sequential machine by using PSC system with T as a finite set of pair-sentence formulas. A pair-sentence form (A0,B1) means that if we assume each stage number i specifies the delay time of the link operation between pair-sentences, then the pair-sentence form (Ai,Bi+1) shows (Ai,Ai+1) (where Ai+1 := Bi) that is the propagation of truth value of a sentence A at one delay time. So, we can define the one delay truth signal circuit by using a pair-sentence form. Moreover, to combine the plural pair-sentences in T, we can define Ms = <TVt, It,O, v0, σt,λt> as a sequential machine generated from T, where TVt a set of truth value products, It a set of input truth value products, O a set of output truth value products, σt : TVtii × Iti → TVti+1 a truth value transition function and λt : TVti × Iti → Oi a truth value output function.},
 pages = {19--32},
 title = {The definition of sequential machine by PSC},
 volume = {1},
 year = {2018},
 yomi = {イシイ, タダオ}
}