Computer Science – Formal Languages and Automata Theory
Scientific paper
2009-07-23
Computer Science
Formal Languages and Automata Theory
11 pages
Scientific paper
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.
No associations
LandOfFree
Primitive Recursive Presentations of Automata and their Products does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Primitive Recursive Presentations of Automata and their Products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Primitive Recursive Presentations of Automata and their Products will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-308637