Fundamentals of Computation Theory

DOI10.1007/B11926zbMath1278.68138OpenAlexW2249105474MaRDI QIDQ5900814

Christian Pech

Publication date: 20 April 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11926

zbMATH Keywords

languageweighttree automatarational expressionKleene's theoremSchützenberger's theorem

Mathematics Subject Classification ID

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

Related Items (3)

Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ Branching automata with costs -- a way of reflecting parallelism in costs ⋮ A Kleene theorem for weighted tree automata over distributive multioperator monoids

This page was built for publication: Fundamentals of Computation Theory