Cited in
(11)- On stateless two-pushdown automata and restarting automata
- Transductions computed by PC-systems of monotone deterministic restarting automata
- Lower bound technique for length-reducing automata
- scientific article; zbMATH DE number 2086618 (Why is no real title available?)
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- Degrees of non-monotonicity for restarting automata
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems
- scientific article; zbMATH DE number 2040896 (Why is no real title available?)
- The Boolean closure of growing context-sensitive languages
- Left-to-right regular languages and two-way restarting automata
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
This page was built for software: UCFL
