pushdown automata 中文意思是什麼
-
Max - product fuzzy context - free grammars and pushdown automata
上下無關文法與下推自動機 -
Existing complexity proofs on the circularity problem of ags are based on automata theory, such as writing pushdown acceptor and alternating turing machines
目前對屬性文法循環性問題復雜度的證明，多基於自動機理論，如寫入推出接受器、交替塗林機等。 -
A note on non - closure property of sublogarithmic space - bounded 1 - inkdot alternating pushdown automata with only existential universal states
因為它們為計算機科學理論的研究提供了一個基本的思想和數學模型。 -
This paper investigates the closure property of sublogarithmic space - bounded 1 - inkdot alternating pushdown automata with only existential universal states, and shows, for example, that for any function l such that l loglogn and l o, the class of sets accepted by weakly strongly l space - bounded 1 - inkdot two - way alternating pushdown automata with only existential universal states is not closed under concatenation with regular sets, length - preserving homomorphism, and kleene closure
Chandra kozen和stockmeyer提出了交替性alternation作為并行計算的一個理論模型。交替式alternating圖靈機是非確定性圖靈機的推廣，它的狀態集合被分為萬能狀態universal state和存在狀態existential state 。非確定性圖靈機可看作只有存在狀態的交替式圖靈機。 -
11 xu j, yoshinaga t, inoue k et al. rm alternation for sublogarithmic space - bounded alternating pushdown automata
對於1墨水點圖靈機，確定性語言族和非確定性語言族是不相等的。 -
10 xu j, inoue k, wang y, ito a. a note on alternating pushdown automata with sublogarithmic space. ieice trans
1墨水點圖靈機是一個兩方向圖靈機，它能夠用墨水點標志出輸入帶上的一個單元格。
分享友人