✦ LIBER ✦

On congruences of automata defined by directed graphs

✍ Scribed by A.V. Kelarev; O.V. Sokratova

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 257 KB
Volume: 301
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00544-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some machines defined by directed graphs

✍ N.G. De Bruijn 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 946 KB

On ground tree transformations and congr

On ground tree transformations and congruences induced by tree automata

✍ Sándor Vágvölgyi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 230 KB

For a tree automaton A over a ranked alphabet , we study the ground tree transformation (A) induced by A and the restriction Â(A) of the congruence ↔ \* A to terms over . We deÿne a congruence relation ⊆ A × A on A, called the determiner of A, and the quotient tree automaton A= . We show the followi

A group of one-to-one transformations de

A group of one-to-one transformations defined by finite automata

✍ F. Geceg 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 190 KB

A note on unimodular congruence of graph

A note on unimodular congruence of graphs

✍ Russell Merris 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 407 KB

A class of linear automata on graphs

✍ A. G. Rutkas; D. M. Chausovskii 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 406 KB

On edge transitivity of directed graphs

✍ Jayme L. Szwarcfiter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 KB

We examine edge transitivity of directed graphs. The class of local comparability graphs is defined as the underlying graphs of locally edge transitive digraphs. The latter generalize edge transitive orientations, while local comparability graphs include comparability, anticomparability, and circle