有窮自動機 的英文怎麼說

中文拼音 [yǒuqióngdòng]
有窮自動機 英文
deterministic finite automata
  • : 有副詞[書面語] (表示整數之外再加零數): 30 有 5 thirty-five; 10 有 5年 fifteen years
  • : Ⅰ形容詞(貧窮) poor; poverty stricken Ⅱ名詞1 (窮盡) limit; end 2 (姓氏) a surname Ⅲ副詞1 (...
  • : Ⅰ代詞(自己) self; oneself; one s own Ⅱ副詞(自然;當然) certainly; of course; naturally; willin...
  • : machineengine
  1. So the storage structure of finite automaton should the choosed adjacency lists

    所以,有窮自動機的存儲結構最好採用鄰接鏈表來存儲。
  2. In this paper, it is shown that some atomic formulas of symbolic states generated by the algorithms can be removed to improve the model checking time - and space - efficiency. such atomic formulas are called as irrelevant atomic formulas. a method is also presented to detect irrelevant formulas based on the test - reset information about clock variables

    一個時間是一個五元組n , l 0 , c , e , i ,其中n為一個的位置集合, l 0n是初始狀態, c是一個取實數值的時鐘變量的集合, e ng c 2 cn是轉換的集合。
  3. The cable - strut tensile structures are the self - stress equilibrium systems composed by tensional cables and struts. in this paper, the basic concept of the structures was described. the analysis methods of the structural characteristics ( statically and kinematically determinate or indeterminate ) and the geometrical stability were presented. it is indicated that the cable - strut tensile structures are in stable equilibrium with first - order infinitesimal mechanisms. the ranks of equilibrium matrix were calculated by employing the singular value decomposition, and the independent modes of inextensional mechanisms and the states of self - stress were also obtained in the same way. this paper contains some typical examples which illustrate all of the main points of the work

    索桿張力結構是指由張力索和壓桿組成的、具預應力平衡的新穎結構體系.本文詳細闡述這種結構的基本概念和結構特徵,討論結構靜定體系特性和幾何穩定性判定分析方法,指出索桿張力結構應具一階無構的幾何穩定體系.文中採用奇異值分解方法計算結構平衡矩陣的秩,並計算獨立構位移模態和應力模態.最後,對幾種典型的索桿張力結構進行了算例分析
  4. Finite state machine minimization

    有窮自動機簡化
  5. Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata

    摘要盡管鄰接矩陣是有窮自動機的一種常用存儲方法,但是,鄰接矩陣並不適合存儲所類型的有窮自動機
  6. The exploitation and study of this system have got great success, compared with the ones of the same type, this system is more open and more easily used to merge with cad and cam, it runs stably, is convenient to be maintained and the interface is friendly and intuitional. its usage can be grasped quickly. according to the input information, it can automatically display different properties of nc codes in different colors, and zoom in or zoom out the figure of tool nose paths dynamically

    本系統的開發研究已取得實質性成果,與國內同類的數控系統相比,具真正的開放性,易於實現與cad cam軟體集成,運行穩定,維護方便,界面友好直觀,易學易用,能根據輸入顯示不同顏色以區廣西大學頎士學趕文募于; m咖ss平臺肘開俠尤三劫肛前喊在系統開發研分代碼的屬性,能態縮放顯示刀具軌跡圖形,此外,它較好的多任務性和獨立性,能在加工時執行其它windows應用程序而不影響加工,控制器甚至能在pc端操作系統關閉時繼續完成加工,可用軟體控制面板或硬體操作面板兩種方式操縱床。
  7. This passage presents a model of fuzzy query control, which absorbs two kinds of conceptions that is dma and clustering algorithm, with the clustering algorithm as the most basic groundwork

    本文提出了一種模糊查詢控制的模型,這個模型吸收了兩種思想,即有窮自動機思想和聚類分組演算法,基礎是採用了分組演算法。
  8. A widely used method for checking real - time systems is, according to the real - time property to be checked, to use a proper bi - simulation equivalence relation to convert the infinite - timed state space to a finite equivalence class space. the algorithm needs only to explore the finite space to get a correct answer. in most cases, exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases. in this paper, an equivalence relation is introduced to check whether a concurrent system, which is composed of a finite set of real - time automata, satisfies a linear duration property. to avoid exhaustive exploration, this paper also introduces a compatibility relation between timed states ( configurations ). based on these two relations, an algorithm is proposed to check whether a real - time automaton network satisfies a linear duration property. the cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature

    一個被廣泛用於驗證實時系統的方法是根據被驗證的實時性質,使用適當的雙向模擬等價關系使無限的狀態空間轉化為限的狀態等價類空間.演算法只需要在這個限的等價類空間里搜索就可以得到正確答案.但是,這個等價類空間的規模一般隨著系統規模的增大而產生爆炸性的增長,以至於在很多情況下,盡搜索這個空間是不現實的.該文引入了一個等價關系來驗證一個由多個實時通過共享變量組成的並發系統是否滿足一個線性時段特性.同時,還引入了格局之間的兼容關系來避免對狀態等價類空間的盡搜索.基於這兩個關系,文章提出了一個演算法來驗證是否一個實時網滿足一個線性時段特性.實例研究顯示,此演算法在某些情況下比其他一些工具更好的時間和空間效率
  9. This dissertation presents a model for composite event detection based on the framework for large - scale event notification services, discussing the ced based on the event model, time model and observation model, and then presents a ced model based on finite state automata extended with a time model, parameterization and concurrent model. based on the above studies, a dynamically extensible and configurable architecture of distributed event notification service is designed, which is presented based on configuration management and meta - service mechanisms with the ability to customize and extend the subscription, event description, interaction protocol and configuration languages

    論文在大規模事件通知服務的通用框架基礎上,分別從事件系統的事件模型、時間模型和觀察模型探討了復合事件的檢測技術,在傳統的狀態基礎上擴充了時間模型、參數化制和並發模型,提出了一種基於效復合事件檢測方法,並將該方法與各種主流方法進行了對比分析。
分享友人