【摘要】 本文给出以栈顶符号重复集接受的ω-cfl和有穷转向的ω-cfl的概念,而把空存储接受作为它的一个特例,证明以栈顶符号重复集接受和以状态重复集接受的ω-cfl(有穷转向的ω-cfl)是同一语言类.给出输入为ω字的f’转换器的概念,并讨论ω超线性语言对若干运算的封闭性质.更多还原

【Abstract】 In this paper we introduce the concept of ω—pda(finite-trurn ω-pda)with acceptence by stack-top symbol repetition set,and prove thatthree accepting models with the acceptance by state repetition set,em-ptying store and stack-top symbol repetition set are equivalent.More-over,We define f’-transducer accepting ω-strings.Having the aid of it,We discuss some closure properties of ω-ultralinear languages.更多还原