A family of languages having only finite-index grammars
From MaRDI portal
Publication:4168091
DOI10.1016/S0019-9958(78)91015-XzbMath0387.68060MaRDI QIDQ4168091
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
On bounded linear codes and the commutative equivalence, Interprocedural Reachability for Flat Integer Programs, A generalization of leftmost derivations