The DOL-ness for context-free languages is decidable

DOI10.1016/0020-0190(76)90062-4zbMath0346.68033OpenAlexW2081553103MaRDI QIDQ1233729

Matti Linna

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90062-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Description of developmental languages using recurrence systems

This page was built for publication: The DOL-ness for context-free languages is decidable