Properties of regular DAG languages

DOI10.1007/978-3-319-30000-9_33MaRDI QIDQ2798739zbMATH OpenOpenAlexFDO

Authors Johannes Blum, Frank Drewes

Publication date 13 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30000-9_33

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Language theoretic properties of regular DAG languages
• On DAG languages and DAG transducers
• Finite Automata on Unranked and Unordered DAGs
• scientific article; zbMATH DE number 4072412
• DAG automata for meaning representation

Cited in

(10)

• Recognition of directed acyclic graphs by spanning tree automata
• Language theoretic properties of regular DAG languages
• On the regularity and learnability of ordered DAG languages
• Some Examples of Semi-rational DAG Languages
• Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
• scientific article; zbMATH DE number 4072412 (Why is no real title available?)
• DAG automata for meaning representation
• On DAG languages and DAG transducers
• Developments in Language Theory
• Tree-Based Generation of Restricted Graph Languages

This page was built for publication: Properties of regular DAG languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798739)