A new class of C.F.L. for which the equivalence is decidable

DOI10.1016/0020-0190(81)90146-0zbMath0482.68066OpenAlexW2027580816MaRDI QIDQ1162819

Géraud Sénizergues

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90146-0

zbMATH Keywords

equivalencedecidabilitycontext-free grammardeterministic context- free languagesN.T.S. grammarsone counter languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

The equivalence of pre-NTS grammars is decidable ⋮ On the Hotz group of a context-free grammar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• One counter languages and the IRS condition
• Opérations de cylindre et applications séquentielles gauches inverses
• The equivalence problem for real-time strict deterministic languages

This page was built for publication: A new class of C.F.L. for which the equivalence is decidable