Finite Tree Automata and W-Automata

Chapter I is a survey of finite automata as acceptors of finite labeled trees. Chapter II is a survey of finite automata as acceptors of infinite strings on a finite alphabet. Among the automata models considered in Chapter II are those used by McNaughton, Buchi, and Landweber. In Chapter II we al...

Full description

Bibliographic Details
Main Author: Hossley, Robert
Published: 2023
Online Access:https://hdl.handle.net/1721.1/149413