Pages that link to "Item:Q5672209"
From MaRDI portal
The following pages link to An infinite hierarchy of intersections of context-free languages (Q5672209):
Displaying 16 items.
- On state-alternating context-free grammars (Q557822) (← links)
- Intersections de langages algébriques bornes (Q754651) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Degree-languages: A new concept of acceptance (Q1236888) (← links)
- Direct or cascade product of pushdown automata (Q1238631) (← links)
- Nondeterminism and Boolean operations in pda's (Q1245576) (← links)
- Counter machines and crystallographic structures (Q2003451) (← links)
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata (Q2164011) (← links)
- Extensional Uniformity for Boolean Circuits (Q3540171) (← links)
- (Q4125808) (← links)
- Observations about bounded languages and developmental systems (Q4128032) (← links)
- Refining nondeterminism in context-free languages (Q4174256) (← links)
- Some restrictions onW-grammars (Q4776853) (← links)
- On growing context-sensitive languages (Q5204308) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
