A Kleene-Schützenberger theorem for trace series over bounded lattices
The author investigates the relation between the recognizability and the rationality of weighted trace languages with weights in a bimonoid, i.e., an algebra with two monoid structures. The bimonoids considered here have various additional properties like local finiteness, commutativity or idempotence. The two special types of rationality studied, \(c\)-rationality and \(mc\)-rationality, are defined by restricting the use of the iteration operation.NEWLINENEWLINE The main theorem states that a trace series over a bi-locally finite strong bimonoid is recognizable if and only if it is \(mc\)-rational, and that, if the bimonoid is also idempotent and commutative, then \(c\)-rationality implies recognizability. In particular, for trace series over a bounded lattice, recognizability, \(mc\)-rationality and \(c\)-rationality are equivalent properties.
- A Kleene-Schützenberger theorem for Lindenmayerian rational power series
- scientific article; zbMATH DE number 1501607
- An extension of Kleene's and Ochmański's theorems to infinite traces
- A sharp upper bound for the size of Lusztig series
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Schur's theorem in integer lattices
- The density theorem for discrete series representations restricted to lattices
- A fixed point theorem with applications to truncated lattices
- \(l\)-trace \(k\)-Sperner families of sets
- Cantor-Bernstein theorem for lattices
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)