An Application of Tree Automata to Linear and Skewlinear Tuple Languages.
Abstract
The theory of tree automata is applied to a class of linear languages and to the skewlinear tuple languages. Closure and decidability properties are studied and analogues of the classical characterizations of Kleene and Myhill are derived. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1972
- Accession Number
- AD0740087
Entities
People
- Oliver L. Costich
Organizations
- University of Iowa