Book ChapterDOI
Finite automata on unranked and unordered DAGs
Lutz Priese
- pp 346-360
Reads0
Chats0
TLDR
In this paper, the authors introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and non-deterministic automata operating on them, which are a conservative extension of the Tu,u-automata of Courcelle on unranked, unordered trees and forests.Abstract:
We introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and nondeterministic automata operating on them. Those dag automata are a conservative extension of the Tu,u-automata of Courcelle on unranked, unordered trees and forests. Several examples of dag languages acceptable and not acceptable by dag automata and some closure properties are given.read more
Citations
More filters
Finite Automata on Unranked and Unordered DAGs Extented Version
TL;DR: In this paper, the authors introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and non-deterministic automata operating on them, and several examples of dag languages acceptable and not acceptable by dag automata and some closure properties are given.
Journal ArticleDOI
Weighted DAG Automata for Semantic Graphs
TL;DR: This article studies the formalism of directed acyclic graph (DAG) automata in depth, demonstrating several new results, including a practical recognition algorithm that can be used for inference and learning with models defined on DAG automata and proposing an extension to graphs with unbounded node degree.
Book ChapterDOI
Properties of Regular DAG Languages
Johannes Blum,Frank Drewes +1 more
TL;DR: Results resembling pumping lemmas are proved and it is shown that the finiteness problem for regular DAG languages is in P.
Bridging Information Visualization with Machine Learning
TL;DR: This report documents the program and the outcomes of Dagstuhl Seminar 15101 “Bridging Information Visualization with Machine Learning”, which identified important challenges to overcome to build systems that integrate machine learning and information visualization.
Journal ArticleDOI
Language theoretic properties of regular DAG languages
Johannes Blum,Frank Drewes +1 more
TL;DR: This work studies sets of directed acyclic graphs, called regular DAG languages, which are accepted by a recently introduced type of DAG automata motivated by current developments in natural language proces.
References
More filters
Book
Tree Automata Techniques and Applications
Hubert Comon,Max Dauchet,Rémi Gilleron,Florent Jacquemard,Denis Lugiez,Christof Löding,Sophie Tison,Marc Tommasi +7 more
TL;DR: The goal of this book is to provide a textbook which presents the basics ofTree automata and several variants of tree automata which have been devised for applications in the aforementioned domains.
Book ChapterDOI
Call-by-value is dual to call-by-name: reloaded
TL;DR: Translations from the λμ-calculus into the dual calculus and back again form an equational correspondence as defined by Sabry and Felleisen (1993), and Composing the translations with duality on theDual calculus yields an involutive notion of dualality on the �λμ-Calculus.
Book ChapterDOI
A Hierarchy of Polynomial-Time Computable Simulations for Automata
TL;DR: In this article, the authors define and provide algorithms for computing a hierarchy of simulation relations on the state-spaces of ordinary transition systems, finite automata, and Buchi automata.