The following pages link to UCFL (Q15487):
Displayed 11 items.
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
- Degrees of non-monotonicity for restarting automata (Q861249) (← links)
- Lower bound technique for length-reducing automata (Q2381504) (← links)
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA (Q3056279) (← links)
- Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (Q3073635) (← links)
- (Q3601403) (← links)
- (Q4452052) (← links)
- (Q4737153) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)