Weighted Automata, Formal Power Series and Weighted Logic

Weighted Automata, Formal Power Series and Weighted Logic PDF

Author: Laura Wirth

Publisher: Springer Nature

Published: 2022-10-13

Total Pages: 191

ISBN-13: 3658393238

DOWNLOAD EBOOK →

The main objective of this work is to represent the behaviors of weighted automata by expressively equivalent formalisms: rational operations on formal power series, linear representations by means of matrices, and weighted monadic second-order logic. First, we exhibit the classical results of Kleene, Büchi, Elgot and Trakhtenbrot, which concentrate on the expressive power of finite automata. We further derive a generalization of the Büchi–Elgot–Trakhtenbrot Theorem addressing formulas, whereas the original statement concerns only sentences. Then we use the language-theoretic methods as starting point for our investigations regarding power series. We establish Schützenberger’s extension of Kleene’s Theorem, referred to as Kleene–Schützenberger Theorem. Moreover, we introduce a weighted version of monadic second-order logic, which is due to Droste and Gastin. By means of this weighted logic, we derive an extension of the Büchi–Elgot–Trakhtenbrot Theorem. Thus, we point out relations among the different specification approaches for formal power series. Further, we relate the notions and results concerning power series to their counterparts in Language Theory. Overall, our investigations shed light on the interplay between languages, formal power series, automata and monadic second-order logic.

Handbook of Weighted Automata

Handbook of Weighted Automata PDF

Author: Manfred Droste

Publisher: Springer Science & Business Media

Published: 2009-09-18

Total Pages: 614

ISBN-13: 3642014925

DOWNLOAD EBOOK →

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 of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the “resources” by “profit” and then be interested in the maximal profit realized, correspondingly, by a given word.

Automata, Languages and Programming

Automata, Languages and Programming PDF

Author: Luis Caires

Publisher: Springer Science & Business Media

Published: 2005-06-24

Total Pages: 1501

ISBN-13: 3540275800

DOWNLOAD EBOOK →

Annotation This book constitutes the refereed proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, held in Lisbon, Portugal in July 2005. The 113 revised full papers presented together with abstracts of 5 invited talks were carefully reviewed and selected from 407 submissions. The papers address all current issues in theoretical computer science and are organized in topical sections on data structures, cryptography and complexity, cryptography and distributed systems, graph algorithms, security mechanisms, automata and formal languages, signature and message authentication, algorithmic game theory, automata and logic, computational algebra, cache-oblivious algorithms and algorithmic engineering, on-line algorithms, security protocols logic, random graphs, concurrency, encryption and related primitives, approximation algorithms, games, lower bounds, probability, algebraic computation and communication complexity, string matching and computational biology, quantum complexity, analysis and verification, geometry and load balancing, concrete complexity and codes, and model theory and model checking.

Developments in Language Theory

Developments in Language Theory PDF

Author: Oscar H. Ibarra

Publisher: Springer

Published: 2006-06-22

Total Pages: 467

ISBN-13: 3540354301

DOWNLOAD EBOOK →

This book constitutes the refereed proceedings of the 10th International Conference on Developments in Language Theory, DLT 2006, held in Santa Barbara, CA, June 2006. The book presents 36 revised full papers together with 4 invited papers. All important issues in language theory are addressed including grammars, acceptors and transducers for strings, trees, graphs, arrays; efficient text algorithms; algebraic theories for automata and languages; and more.

Implementation and Application of Automata

Implementation and Application of Automata PDF

Author: Jan Holub

Publisher: Springer

Published: 2007-10-28

Total Pages: 326

ISBN-13: 3540763368

DOWNLOAD EBOOK →

This book constitutes the thoroughly refereed post-proceedings of the 12th International Conference on Implementation and Application of Automata, CIAA 2007. The 23 revised full papers and seven revised poster papers presented together with the extended abstracts of four invited lectures were carefully reviewed and have gone through two rounds of reviewing. The papers cover various topics in the theory, implementation, and applications of automata and related structures.

Automata, Languages and Programming

Automata, Languages and Programming PDF

Author: Samson Abramsky

Publisher: Springer Science & Business Media

Published: 2010-06-30

Total Pages: 637

ISBN-13: 3642141617

DOWNLOAD EBOOK →

The two-volume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010. The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6199 contains 46 contributions of track B and C selected from 167 submissions as well as 4 invited talks.

Advances in Logic Based Intelligent Systems

Advances in Logic Based Intelligent Systems PDF

Author: Kazumi Nakamatsu

Publisher: IOS Press

Published: 2005

Total Pages: 304

ISBN-13: 1586035681

DOWNLOAD EBOOK →

LAPTEC' 2005 promoted the discussion and interaction between researchers and practitioners focused on both theoretical and practical disciplines concerning logics applied to technology, with diverse backgrounds including all kinds of intelligent systems having classical or non-classical logics as underlying common matters.

Mathematical Foundations of Computer Science 2010

Mathematical Foundations of Computer Science 2010 PDF

Author: Petr Hlineny

Publisher: Springer Science & Business Media

Published: 2010-08-10

Total Pages: 730

ISBN-13: 364215154X

DOWNLOAD EBOOK →

This volume constitutes the refereed proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, held in Brno, Czech Republic, in August 2010. The 56 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 149 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.

Logical Foundations of Computer Science

Logical Foundations of Computer Science PDF

Author: Sergei Artemov

Publisher: Springer

Published: 2007-06-30

Total Pages: 516

ISBN-13: 3540727345

DOWNLOAD EBOOK →

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume presents 36 revised refereed papers that address all current aspects of logic in computer science.

Automata, Languages and Programming

Automata, Languages and Programming PDF

Author: Luca Aceto

Publisher: Springer Science & Business Media

Published: 2008-06-24

Total Pages: 751

ISBN-13: 3540705821

DOWNLOAD EBOOK →

ICALP 2008, the 35th edition of the International Colloquium on Automata, Languages and Programming, was held in Reykjavik, Iceland, July 7–11, 2008. ICALP is a series of annual conferences of the European Association for Th- reticalComputer Science(EATCS) which ?rsttook placein 1972.This year,the ICALP program consisted of the established Track A (focusing on algorithms, automata,complexityandgames)andTrackB(focusing onlogic,semanticsand theory of programming), and of the recently introduced Track C (focusing on security and cryptography foundations). In response to the call for papers, the Program Committees received 477 submissions, the highest ever: 269 for Track A, 122 for TrackB and 86 for Track C. Out of these, 126 papers were selected for inclusion in the scienti?c program: 70 papers for Track A, 32 for Track B and 24 for Track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many deserving papers could not be selected. ICALP 2008 consisted of ?ve invited lectures and the contributed papers.