Schützenberger's theorem on formal power series follows from Kleene's theorem
From MaRDI portal
Publication:935170
DOI10.1016/j.tcs.2008.04.041zbMath1147.68043MaRDI QIDQ935170
Publication date: 31 July 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.041
68Q45: Formal languages and automata
Related Items
Construction of fuzzy automata from fuzzy regular expressions, Weighted automata, Adding pebbles to weighted automata: easy specification \& efficient evaluation, Valuations of Weighted Automata: Doing It in a Rational Way
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching automata with costs -- a way of reflecting parallelism in costs
- Skew and infinitary formal power series
- Characterizations of recognizable picture series
- Equational elements in additive algebras
- A Kleene theorem for weighted tree automata
- On the definition of a family of automata
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
- Fundamentals of Computation Theory