Pages that link to "Item:Q1770387"
From MaRDI portal
The following pages link to Finite graph automata for linear and boundary graph languages (Q1770387):
Displaying 8 items.
- Finite automata on directed graphs (Q1191024) (← links)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- BORDERS AND FINITE AUTOMATA (Q3503101) (← links)
- Graph automata for linear graph languages (Q4645286) (← links)
- Efficient recognition algorithms for boundary and linear eNCE graph languages (Q5941743) (← links)
- Synthesis and Analysis of Petri Nets from Causal Specifications (Q6487344) (← links)