《正则代数与有限自动机》封面

正则代数与有限自动机

Regular algebra and finite machines

John Horton Conway · 初版 1971 年

2人推荐
2位读者提及
3次提及

Hacker News 上怎么说

  • 没错!图(graph)有很多有趣的代数性质。我目前不知道有哪些论文把图看作克莱尼代数(Kleene algebras)(不过我也没特意去找过)。Conway 的《Regular Algebra and Finite Machines》[1] 以及 Kozen 的《A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events》[2] 都是学习克莱尼代数的很有意思的读物。[1] https://www.amazon.com/Regular-Algebra-Finite-Machines-Mathe...…

    Yes! Graphs have many interesting algebraic properties. I'm not aware of articles treating graphs as Kleene algebras (I haven't looked for them though). Conway's "Regular Algebra and Finite Machines" [1] and Kozen's "A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events" [2] are interesting texts to read on Kleene algebra. [1] https://www.amazon.com/Regular-Algebra-Finite-Machines-Mathe...…

  • 想看针对这个观点的一整本书(相当于1960年代一整门课的篇幅),可以参考 Conway 的《Regular Algebra and Finite Machines》

    For a book length (1960's course length) take on this idea, see Conway, Regular Algebra and Finite Machines

  • > 以任意顺序等待 state1a、state1b、state1c Conway 大约半个世纪前在《Regular Algebra and Finite Machines》中就推导出了非序列化(交换性)事件的一些结论。

    > wait for state1a, state1b state1c in any order Conway worked out some results for non-serialised (commutative) events in Regular Algebra and Finite Machines about half a century ago.

正在加载完整评论……

键盘快捷键

/
聚焦搜索框
j / k
下一本 / 上一本
Enter
打开选中的书
Esc
关闭 / 返回
g h
回到首页
g b
值得读精选
g t
历史总榜
g r
上升最快
g l
我的书架
?
显示本帮助