Positive varieties of lattice languages
From MaRDI portal
Cites work
- Formations of finite monoids and formal languages: Eilenberg's variety theorem revisited.
- Generating a random permutation with random transpositions
- Handbook of weighted automata
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- Lattice Automata
- Markov chains and unambiguous automata
- Model checking with multi-valued logics
- On finite monoids having only trivial subgroups
- Random walks on finite groups
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Semidirect product decompositions for periodic regular languages
- Shuffling Cards and Stopping Times
- Syntactic semiring of a language. (Extended abstract)
- Unified theory for finite Markov chains
This page was built for publication: Positive varieties of lattice languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861882)