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...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149413 |
| _version_ | 1826194820750639104 |
|---|---|
| author | Hossley, Robert |
| author_facet | Hossley, Robert |
| author_sort | Hossley, Robert |
| collection | MIT |
| description | 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 also consider several new automata models based on a notion of a run of a finite automataton on an infinite string suggested by Professor A.R. Meyer in private communication. We show that these new models are all equivalent to various previously formulated models. |
| first_indexed | 2024-09-23T10:02:19Z |
| id | mit-1721.1/149413 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T10:02:19Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1494132023-04-07T18:09:13Z Finite Tree Automata and W-Automata Hossley, Robert 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 also consider several new automata models based on a notion of a run of a finite automataton on an infinite string suggested by Professor A.R. Meyer in private communication. We show that these new models are all equivalent to various previously formulated models. 2023-03-29T14:57:02Z 2023-03-29T14:57:02Z 1972-09 https://hdl.handle.net/1721.1/149413 MIT-LCS-TR-102 MAC-TR-102 application/pdf |
| spellingShingle | Hossley, Robert Finite Tree Automata and W-Automata |
| title | Finite Tree Automata and W-Automata |
| title_full | Finite Tree Automata and W-Automata |
| title_fullStr | Finite Tree Automata and W-Automata |
| title_full_unstemmed | Finite Tree Automata and W-Automata |
| title_short | Finite Tree Automata and W-Automata |
| title_sort | finite tree automata and w automata |
| url | https://hdl.handle.net/1721.1/149413 |
| work_keys_str_mv | AT hossleyrobert finitetreeautomataandwautomata |