Abstract
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.
Get full access to this article
View all access options for this article.