On transductions of formal power series over complete semirings

DOI10.1016/0304-3975(92)90377-RzbMath0796.68131OpenAlexW2066052117MaRDI QIDQ1194315

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)90377-r

zbMATH Keywords

formal languagesformal power seriescomplete semiringNivat's Theorempushdown transduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semirings (16Y60) Formal power series rings (13F25)

Related Items

On embedding in complete semirings, The algebraic equivalent of AFL theory, Nivat's theorem for pushdown transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monoides et semi-anneaux continus. (Continuous monoids and semirings)
• A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
• Nivat's theorem for pushdown transducers
• On limits in complete semirings
• Automata and languages generalized to \(\omega\)-continuous semirings