UCFL
From MaRDI portal
Software:15487
No author found.
Related Items (11)
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 ⋮ Lower bound technique for length-reducing automata ⋮ Degrees of non-monotonicity for restarting automata ⋮ Left-to-right regular languages and two-way restarting automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Expressive power of \(\text{LL}(k)\) Boolean grammars ⋮ ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA ⋮ Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata
This page was built for software: UCFL
