General theory of relational automata

Věra Trnková · Fundamenta Informaticae · 1980

General theory of relational automata, including non-deterministic linear and bilinear machines, structured non-deterministic tree automata and automata in some primitive classes of algebras, is developed. Particular attention is paid to languages accepted by finite relational automata.

Read the paper · More papers on PaperTik