Positive varieties of lattice languages

DOI10.1007/978-3-032-01475-7_7MaRDI QIDQ6861882zbMATH OpenFDO

Authors Yusuke Inoue, Yuji Komatsu

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01475-7_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Automata, Languages and Programming
• 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?)
• scientific article; zbMATH DE number 2042290 (Why is no real title available?)
• scientific article; zbMATH DE number 1848285 (Why is no real title available?)
• Lattice Automata
• Markov chains and unambiguous automata
• On finite monoids having only trivial subgroups
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Semidirect product decompositions for periodic regular languages
• Shuffling Cards and Stopping Times
• 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)