A family of languages having only finite-index grammars

From MaRDI portal

Revision as of 11:23, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4168091

Jump to:navigation, search

DOI10.1016/S0019-9958(78)91015-XzbMath0387.68060MaRDI QIDQ4168091

Publication date: 1978

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Interprocedural Reachability for Flat Integer Programs ⋮ On bounded linear codes and the commutative equivalence ⋮ A generalization of leftmost derivations

This page was built for publication: A family of languages having only finite-index grammars

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4168091&oldid=17987421"