A Kleene-Schützenberger theorem for trace series over bounded lattices

zbMATH Open1257.68097MaRDI QIDQ2882389

Martin Huschenbett

Publication date: 4 May 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: http://iospress.metapress.com/content/y01p7x314587550p/fulltext.html

zbMATH Keywords

concurrencyformal power seriesweighted automatarational seriestrace languagesrecognizable seriesbimonoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Schützenberger's theorem on formal power series follows from Kleene's theorem

Recommendations

• \(l\)-trace \(k\)-Sperner families of sets 👍 👎
• An extension of Kleene's and Ochmański's theorems to infinite traces 👍 👎
• The Kleene-Schützenberger theorem for formal power series in partially commuting variables. 👍 👎
• A fixed point theorem with applications to truncated lattices 👍 👎
• A sharp upper bound for the size of Lusztig series 👍 👎
• The density theorem for discrete series representations restricted to lattices 👍 👎
• A Kleene-Schützenberger theorem for Lindenmayerian rational power series 👍 👎
• Cantor-Bernstein theorem for lattices 👍 👎
• Schur's theorem in integer lattices 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A Kleene-Schützenberger theorem for trace series over bounded lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882389)