❄ DAG ❄ – Directed acyclic graphs (DAGs) and DAG automata
people 0 subscribers · pubsub.movim.eu
Äquivalenzrelation als Pfeildiagramm und als Äquivalenzklassen
eevvoor · pubsub.movim.eu / dags · Saturday, 17 October, 2020 - 20:52 edit
Menge von acht Buchexemplaren mit eingezeichneter Äquivalenzrelation „a und b besitzen dieselbe ISBN“ als Pfeildiagramm und den Äquivalenzklassen
Overview Pic Algebraic Structures
eevvoor · pubsub.movim.eu / dags · Saturday, 17 October, 2020 - 20:44 edit
eevvoor · pubsub.movim.eu / dags · Saturday, 17 October, 2020 - 20:42
Contact publication
Congruence
eevvoor · pubsub.movim.eu / dags · Saturday, 17 October, 2020 - 20:25
In abstract algebra, a congruence relation (or simply congruence) is an equivalence relation on an algebraic structure (such as a group, ring, or vector space) that is compatible with the structure in the sense that algebraic operations done with equivalent elements will yield equivalent elements.
DAG language 𝜆 ⭠r⭢ qq, qq⭠l⭢ 𝜆
eevvoor · pubsub.movim.eu / dags · Friday, 16 October, 2020 - 17:55 edit
With the two rules below, a DAG automaton can pump to have an infinite number of DAGs in its language. The picture shows three of those DAGs. The last one can be accomplished by swapping edges of the first two DAGs.
Myhill-Nerode Equivalence Relation for DAG-automata
eevvoor · pubsub.movim.eu / dags · Friday, 16 October, 2020 - 15:00 edit
The Myhill-Nerode equivalence relation was initially used for string languages. This equivalence is an open problem for DAG languages.
Directed Acyclic Graphs -- DAGs
eevvoor · pubsub.movim.eu / dags · Friday, 16 October, 2020 - 14:46 edit
This is my jotter for drafting and sketching stuff about DAGs and DAG automata.
We can say "Hi!" with five connected DAGs or one unconnected DAG.