Nivat's theorem for pushdown transducers

DOI10.1016/0304-3975(92)90077-SzbMath0769.68101OpenAlexW2036725396MaRDI QIDQ1193872

Georg Karner

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90077-s

zbMATH Keywords

pushdown transducerextended pushdown automatonNivat's theorempushdown transition matrix

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (2)

Decomposition and factorization of chemical reaction transducers ⋮ On transductions of formal power series over complete semirings

Cites Work

• A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
• On transductions of formal power series over complete semirings
• On the Hurwitz product of formal power series and automata
• Optimization of Straight Line Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nivat's theorem for pushdown transducers