Automata theory allows practice with formal definitions of computation as it introduces concepts relevant to other nontheoretical areas of computer science 自動(dòng)控制理論允許執(zhí)行正式的計(jì)算定義,因?yàn)樗昧讼嚓P(guān)的計(jì)算機(jī)科學(xué)的其他非理論方面的概念。
Existing complexity proofs on the circularity problem of ags are based on automata theory , such as writing pushdown acceptor and alternating turing machines 目前對(duì)屬性文法循環(huán)性問題復(fù)雜度的證明,多基于自動(dòng)機(jī)理論,如寫入推出接受器、交替涂林機(jī)等。
This paper presents some cellular automata models for traffic flow simulation . firstly , the celluar automata theory was introduced , cellular autoata models quantize complex behavior into simple individual components 本文首先介紹了元胞自動(dòng)機(jī)理論的理論,元胞自動(dòng)機(jī)模型把復(fù)雜系統(tǒng)量化為簡(jiǎn)單的個(gè)體。
Security analyses of a variant of a new block cipher system ( called cac ) based on cellular automata theory are given using two cryptanalytic approaches . the results show that this variant of cac is very insecure under chosen - plaintext attacks 利用兩種方法對(duì)一個(gè)基于細(xì)胞自動(dòng)機(jī)的分組密碼系統(tǒng)cac的變形進(jìn)行了分析,結(jié)果表明: cac的這種變形在選擇明文攻擊下是極不安全的。
The paper formally defines the concept of electronic contract and their goals , obligations , bindings and non - repudiatable proofs by the formal language and automata theory . by making the obligations and proofs work together , the partners are enforced to achieve the business goals 本文用形式語(yǔ)言與自動(dòng)機(jī)理論對(duì)電子合同及其目標(biāo)、責(zé)任、約束以及不可抵賴性證據(jù)進(jìn)行形式化定義,使責(zé)任和證據(jù)相互配合,迫使達(dá)到商業(yè)目標(biāo)。
Automata theory is an important branch of computer science theory . it is widely applied in many fields , such as communication , detection , biology , neurology , psychology , intelligence , economy , and sociology . the research on it is closely related to the development of computer software and hardware 自動(dòng)機(jī)理論是計(jì)算機(jī)科學(xué)中的一個(gè)重要組成部分,在通訊、檢測(cè)、生物、神經(jīng)、心理、智能、經(jīng)濟(jì)和社會(huì)等諸多領(lǐng)域都有著廣泛應(yīng)用,其研究與計(jì)算機(jī)軟硬件發(fā)展密切相關(guān)。
In multiple - valued logic theory , completeness theory of function sets is an important and fundamental problem , it is also the problem which must be solved in automata theory and multiple - valued logic network . the solution of this problem depends on determining all the precomplete classes in multiple - valued logic function sets 函數(shù)系的完備性判定問題是多值邏輯理論中基本而重要的問題,同時(shí)也是自動(dòng)機(jī)理論,多值邏輯網(wǎng)絡(luò)中必須解決的問題,此問題的解決依賴于定出多值邏輯函數(shù)集中的所有極大封閉集(準(zhǔn)完備集) 。