Primitive Recursive Presentations of Automata and their Products

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-308637

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.