Handbook of Weighted Automata

The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount o...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Droste, Manfred (Editor ), Kuich, Werner (Editor ), Vogler, Heiko (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Edición:1st ed. 2009.
Colección:Monographs in Theoretical Computer Science. An EATCS Series,
Temas:
Computer science.
Natural language processing (Computer science).
Machine theory.
Mathematical logic.
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Natural Language Processing (NLP).
Formal Languages and Automata Theory.
Mathematical Logic and Foundations.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Foundations
  • Semirings and Formal Power Series
  • Fixed Point Theory
  • Concepts of Weighted Recognizability
  • Finite Automata
  • Rational and Recognisable Power Series
  • Weighted Automata and Weighted Logics
  • Weighted Automata Algorithms
  • Weighted Discrete Structures
  • Algebraic Systems and Pushdown Automata
  • Lindenmayer Systems
  • Weighted Tree Automata and Tree Transducers
  • Traces, Series-Parallel Posets, and Pictures: A Weighted Study
  • Applications
  • Digital Image Compression
  • Fuzzy Languages
  • Model Checking Linear-Time Properties of Probabilistic Systems
  • Applications of Weighted Automata in Natural Language Processing.

Ejemplares similares