The triple-pair construction for weighted w-pushdown automata

Manfred Droste, Z. Ésik, Werner Kuich

Research output: Contribution to journalConference article

3 Citations (Scopus)


Let S be a complete star-omega semiring and S be an alphabet. For a weighted w-pushdown automatonP with stateset {1, . . . ,n}, n ≥ 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ((S≪S ≫)n×n , (S≪Sw ≫)n) such that the behavior kPk of P is a component of a solution of this system. In case the basic semiring is B or N¥ we show that there exists a mixed context-free grammar that generates //P//. The construction of the mixed context-free grammar from P is a generalization of the well known triple construction and is called now triple-pair construction for w-pushdown automata.

Original languageEnglish
Pages (from-to)101-113
Number of pages13
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Publication statusPublished - Aug 21 2017
Event15th International Conference on Automata and Formal Languages, AFL 2017 - Debrecen, Hungary
Duration: Sep 4 2017Sep 6 2017


ASJC Scopus subject areas

  • Software

Cite this