Counter-Free Automata

by Robert McNaughton and Seymour Papert

A particular class of finite-state automata, christened by the authors "counter-free," is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed itself so deeply in the conceptual character of several quite different approaches to automata theory that on the surface it is hard to believe that all these roles are being assumed by the same class. This is one of the reasons it has been chosen for study...

• Format: Hardcover
• Language: English
• ISBN: 0262130769
• ISBN13: 9780262130769
• Release Date: January 1971
• Publisher: MIT Press (MA)
• Length: 163 Pages
• Weight: 1.14 lbs.