Pages that link to "Item:Q1112610"
From MaRDI portal
The following pages link to Some subclasses of context-free languages in \(NC^ 1\) (Q1112610):
Displaying 12 items.
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← links)
- On linear languages recognized by deterministic biautomata (Q2672654) (← links)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642) (← links)
- Extensional Uniformity for Boolean Circuits (Q3540171) (← links)
- On the transformation of LL\((k)\)-linear to LL(1)-linear grammars (Q6038708) (← links)
