• Weighted automata and weighted...

Treffer: Weighted automata and weighted logics

Title:
Weighted automata and weighted logics
Authors:
DROSTE, Manfred, GASTIN, Paul
Source:
Automata, languages and programming (ICALP 2005)Theoretical computer science. 380(1-2):69-86
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 32 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Divers, Miscellaneous, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Automate, Automaton, Autómata, Compression, Compresión, Image, Imagen, Informatique théorique, Computer theory, Informática teórica, Logique ordre 1, First order logic, Lógica orden 1, Mappage, Mapping, Carta de datos, Mot, Word, Palabra, Ordre 1, First order, Orden 1, Phrase, Sentence, Frase, Puissance, Power, Potencia, Superficie, Area, Série entière, Power series, Serie potencias, Série formelle, Formal series, Serie formal, Texte, Text, Texto, Traitement parole, Speech processing, Tratamiento palabra, 03B10, 68P30, 68Q45, Semi-anneau, Formal power series, Weighted automata, Weighted logics
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institut fir Informatik, Universität Leipzig, 04009 Leipzig, Germany
LSV, ENS Cachan & CNRS, 61, Av. du Président Wilson, 94235 Cachan, France
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18821614
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.18821614
Database:
PASCAL Archive

Weitere Informationen

Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour of such an automaton is a mapping, called a formal power series, assigning to each word a weight in some semiring. We generalize Biichi's and Elgot's fundamental theorems to this quantitative setting. We introduce a weighted version of MSO logic and prove that, for commutative semirings, the behaviours of weighted automata are precisely the formal power series definable with particular sentences of our weighted logic. We also consider weighted first-order logic and show that aperiodic series coincide with the first-order definable ones, if the semiring is locally finite, commutative and has some aperiodicity property.