Graph algebras and automata

著者

• Kelarev, A. V. (Andrei V.)

書誌事項

Graph algebras and automata

Andrei Kelarev

（Monographs and textbooks in pure and applied mathematics, 257）

Marcel Dekker, c2003

注記

Bibliography: p. 329-350

Includes index

内容説明・目次

内容説明

Graph algebras possess the capacity to relate fundamental concepts of computer science, combinatorics, graph theory, operations research, and universal algebra. They are used to identify nontrivial connections across notions, expose conceptual properties, and mediate the application of methods from one area toward questions of the other four. After a concentrated review of the prerequisite mathematical background, Graph Algebras and Automata defines graph algebras and reveals their applicability to automata theory. It proceeds to explore assorted monoids, semigroups, rings, codes, and other algebraic structures and to outline theorems and algorithms for finite state automata and grammars.

目次

Preface, 1. Preliminaries, 2. Algebraic Structures, 3. Automata and Languages, 4. Syntactic Monoids of Automata, 5. Congruences on Automata, 6. Minimal Automata, 7. Languages, 8. Tree Languages, 9. Equational Theories, 10. Groupoid Rings, 11. Dualities, Topologies, Flatness, 12. Open Problems, Appendix A. Glossary of Notation, Bibliography, Index

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BA6322625X
• ISBN:
  • 0824747089
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: New York
• ページ数/冊数: viii, 366 p.
• 大きさ: 24 cm
• 親書誌ID:
  • BA00046446