Weighted Automata, Formal Power Series and Weighted Logic
Laura Wirth
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.
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.
年:
2022
出版商:
Springer Spektrum
語言:
english
頁數:
190
ISBN 10:
365839322X
ISBN 13:
9783658393229
系列:
BestMasters
文件:
PDF, 1.90 MB
IPFS:
,
english, 2022
Amazon 
Barnes & Noble 
Bookshop.org 
轉換文件
更多的搜索結果
其他特權 ![Thomas Colcombet — Green's Relations and their Use in Automata Theory [expository notes]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/b7749881c93048c54a945357807c3d0e069e162768953195bae55691616e2208.jpg)
![Jean-Éric Pin — Mathematical Foundations of Automata Theory [draft]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/95301b0fc80bcbb55613c9a5e73c4339d9b122f8ea83a38c6c4049348589b992.jpg)
![Facundo Matias Carreiro — Fragments of Fixpoint Logics. Automata and Expressiveness [PhD Thesis]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/11ef19a87a9260614df967e2e9736d34e55d4595ab60902a03d09b351ec75336.jpg)
最常見的術語
相關書單
