UCFL
From MaRDI portal
Software:15487
swMATH2951MaRDI QIDQ15487FDOQ15487
Author name not available (Why is that?)
Cited In (11)
- Transductions computed by PC-systems of monotone deterministic restarting automata
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems
- Title not available (Why is that?)
- On stateless two-pushdown automata and restarting automata
- Left-to-right regular languages and two-way restarting automata
- Lower bound technique for length-reducing automata
- Degrees of non-monotonicity for restarting automata
- The Boolean closure of growing context-sensitive languages
- Title not available (Why is that?)
This page was built for software: UCFL
