确定性图 meaning in Chinese

determinacy diagram

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 。非确定性图灵机可看作只有存在状态的交替式图灵机。