Pages that link to "Item:Q1389767"
From MaRDI portal
The following pages link to A hierarchy of eNCE families of graph languages (Q1389767):
Displaying 12 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- Double Greibach operator grammars (Q1589438) (← links)
- Representing graph families with edge grammars (Q1801468) (← links)
- Emptiness problems of eNCE graph languages (Q1908340) (← links)
- A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions (Q1920234) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)