Automata and languages generalized to \(\omega\)-continuous semirings

DOI10.1016/0304-3975(91)90147-TzbMath0719.68034MaRDI QIDQ2640344

Werner Kuich

Publication date: 1991

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

zbMATH Keywords

polynomial algebrapushdown automataKleene's theorem\(\omega \) -continuous semiring

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (13)

On syntactic nuclei of rational languages ⋮ On Lindenmayerian algebraic power series ⋮ On Lindenmayerian algebraic sequences ⋮ The equational logic of fixed points ⋮ The net automaton of a rational expression ⋮ An iteration property of Lindenmayerian power series ⋮ Representations and complete semiring morphisms ⋮ The algebraic equivalent of AFL theory ⋮ On transductions of formal power series over complete semirings ⋮ On limits in complete semirings ⋮ THE VALIDITY OF WEIGHTED AUTOMATA ⋮ On D0L power series ⋮ Unique, guarded fixed points in an additive setting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automata and languages generalized to \(\omega\)-continuous semirings