Weighted automata and multi-valued logics over arbitrary bounded lattices

Manfred Droste; Heiko Vogler

doi:10.1016/j.tcs.2011.11.008

ScienceGate Book Chapters

JOURNAL ARTICLE

Weighted automata and multi-valued logics over arbitrary bounded lattices

Manfred Droste Heiko Vogler

Year: 2011 Journal: Theoretical Computer Science Vol: 418 Pages: 14-36 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2011.11.008

Get Full-Text PDF Get Analytical Report

Keywords:

Bounded function Distributivity Mathematics Discrete mathematics Expressive power Automaton Order (exchange) Lattice (music) Combinatorics Pure mathematics Distributive property Computer science Theoretical computer science

Metrics

Cited By

5.43

FWCI (Field Weighted Citation Impact)

Refs

0.96

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

semigroups and automata theory

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Algebra and Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

Weighted automata and multi-valued logics over arbitrary bounded lattices

Metrics

Citation History

Topics

Related Documents

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices

Description logics over lattices with multi-valued ontologies

Multi-valued Logics, Automata, Simulations, and Games

Weighted Automata and Weighted Logics

Weighted automata and weighted logics