自动机及其乘积的本原递归表示
Primitive Recursive Presentations of Automata and their Products
摘要：
讨论了通过原始递归函数抽象指定Moore型状态机（传感器）和通过同时原始递归定义并行组合的方法。该方法主要是作为一种简洁方便的方式来处理计算机编程和工程中发现的复杂状态系统，但有一小部分表明与代数自动机理论和Krohn和Rhodes定理的联系。
英文摘要：
Methods for specifying Moore type state machines (transducers) abstractly via primitive recursive functions and for defining parallel composition via simultaneous primitive recursion are discussed. The method is mostly of interest as a concise and convenient way of working with the complex state systems found in computer programming and engineering, but a short section indicates connections to algebraic automata theory and the theorem of Krohn and Rhodes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
