陕西师范大学学报（自然科学版）2017，Vol.45Issue(3)：9-16,8.DOI:10.15983/j.cnki.jsnu.2017.03.133
取值于赋值幺半群的加权下推自动机的代数性质
Algebraic properties of weighted pushdown automata over valuation monoid
摘要
Abstract
By introducing the concepts of weighted pushdown automata and weighted normalized pushdown automata over valuation monoid, the equivalence of weighted pushdown automata and weighted normalized pushdown automata over double unitary valuation monoid is proved.It is shown that the fact that weighted pushdown automata can accept the same formal power series by final states and by empty stack at the same time.The closed properties of weighted context-free languages under some regular operations such as sum, concatenation and positive Kleene closure are dealt with as well.The main conclusions show that whether those properties of weighted pushdown automata are valid or not doesn't rely on the distributivity or associativity of valuation monoid.关键词
赋值幺半群/双幺赋值幺半群/加权下推自动机/加权上下文无关语言Key words
valuation monoid/double unital valuation monoid/weighted pushdown automaton/weighted context-free language分类
信息技术与安全科学引用本文复制引用
付雯静,韩召伟..取值于赋值幺半群的加权下推自动机的代数性质[J].陕西师范大学学报（自然科学版）,2017,45(3):9-16,8.基金项目
国家自然科学基金(11401361,11226266) （11401361,11226266）
中央高校基本科研业务费专项资金(GK201402002) （GK201402002）
陕西省教育厅自然科学专项科研计划(16JK1373) （16JK1373）
