Handbook of theoretical computer science (vol. B)
Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
On rational series and rational languages
Theoretical Computer Science
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Automata theory based on quantum logic: some characterizations
Information and Computation
A theory of computation based on quantum logic (I)
Theoretical Computer Science
Weighted tree automata and weighted logics
Theoretical Computer Science
Weighted automata and weighted logics
Theoretical Computer Science
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables
Theory of Computing Systems
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Weighted Logics for Nested Words and Algebraic Formal Power Series
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Weighted versus Probabilistic Logics
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Expressiveness and Closure Properties for Quantitative Languages
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Definable transductions and weighted logics for texts
DLT'07 Proceedings of the 11th international conference on Developments in language theory
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Weighted Logics for Unranked Tree Automata
Theory of Computing Systems
Weighted Picture Automata and Weighted Logics
Theory of Computing Systems
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Deductive multi-valued model checking
ICLP'05 Proceedings of the 21st international conference on Logic Programming
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
Weighted nested word automata and logics over strong bimonoids
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
We show that L-weighted automata, L-rational series, and L-valued monadic second order logic have the same expressive power, for any bounded lattice L and for finite and infinite words. We also prove that aperiodicity, star-freeness, and L-valued first-order and LTL-definability coincide. This extends classical results of Kleene, Buchi-Elgot-Trakhtenbrot, and others to arbitrary bounded lattices, without any distributivity assumption that is fundamental in the theory of weighted automata over semirings. In fact, we obtain these results for large classes of strong bimonoids which properly contain all bounded lattices.