There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages

DOI10.1007/BF01156601zbMath0800.68535MaRDI QIDQ1177785

Konstantin Yu. Gorbunov

Publication date: 26 June 1992

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

context-free grammarssingle-valued languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

One application of real-valued interpretation of formal power series.

Cites Work

• Unnamed Item
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• A note on finite-valued and finitely ambiguous transducers
• On the equivalence and containment problems for context-free languages

This page was built for publication: There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages