The DOL-ness for context-free languages is decidable

DOI10.1016/0020-0190(76)90062-4zbMATH Open0346.68033OpenAlexW2081553103MaRDI QIDQ1233729FDOQ1233729

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Description of developmental languages using recurrence systems

Cited In (1)

• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1233729)