Pages that link to "Item:Q1041757"
From MaRDI portal
The following pages link to Closure properties and decision problems of dag automata (Q1041757):
Displaying 12 items.
- Rigid tree automata and applications (Q553317) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Recognition of directed acyclic graphs by spanning tree automata (Q1959657) (← links)
- Computational properties of partial non-deterministic matrices and their logics (Q2151408) (← links)
- An unexpected Boolean connective (Q2169126) (← links)
- Language theoretic properties of regular DAG languages (Q2272978) (← links)
- Parameterized complexity of basic decision problems for tree automata (Q2855747) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- TREE AUTOMATA WITH GLOBAL CONSTRAINTS (Q3586405) (← links)
- Rigid Tree Automata (Q3618602) (← links)
- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (Q3637347) (← links)
- Monadicity of non-deterministic logical matrices is undecidable (Q6659898) (← links)
