The decidability of equivalence for a family of linear grammars

DOI10.1016/S0019-9958(80)90741-XzbMath0469.68074OpenAlexW2063332329MaRDI QIDQ3923621

Amiram Yehudai

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/s0019-9958(80)90741-x

zbMATH Keywords

equivalence problemnondeterministic languageslinear unambiguous context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Propositional dynamic logic of nonregular programs, Homomorphic characterizations of recursively enumerable languages with very small language classes, Even linear simple matrix languages: formal language properties and grammatical inference.