| 期刊全稱 | Automata-Theoretic Aspects of Formal Power Series | | 影響因子2023 | Arto Salomaa,Matti Soittola | | 視頻video | http://file.papertrans.cn/167/166242/166242.mp4 | | 學(xué)科分類 | Monographs in Computer Science | | 圖書封面 |  | | 影響因子 | This book develops a theory of formal power series in noncommuting variables, the main emphasis being on results applicable to automata and formal language theory. This theory was initiated around 196O-apart from some scattered work done earlier in connection with free groups-by M. P. Schutzenberger to whom also belong some of the main results. So far there is no book in existence concerning this theory. This lack has had the unfortunate effect that formal power series have not been known and used by theoretical computer scientists to the extent they in our estimation should have been. As with most mathematical formalisms, the formalism of power series is capable of unifying and generalizing known results. However, it is also capable of establishing specific results which are difficult if not impossible to establish by other means. This is a point we hope to be able to make in this book. That formal power series constitute a powerful tool in automata and language theory depends on the fact that they in a sense lead to the arithmetization of automata and language theory. We invite the reader to prove, for instance, Theorem IV. 5. 3 or Corollaries III. 7. 8 and III. 7.- all specific | | Pindex | Textbook 1978 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-16 01:21
發(fā)表于 2025-3-21 18:55:37
