Necessary and sufficient conditions for a power language to be deterministic

DOI10.1080/00207167508803107MaRDI QIDQ4099223zbMATH OpenOpenAlexWikidataFDO

Authors R. K. Shyamasundar

Publication date 1975

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207167508803107

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A necessary and sufficient condition for a power language to be LL(k)
• Deterministic context free languages
• LR-regular grammars - an extension of LR(k) grammars
• The theory of left factored languages: part 2

This page was built for publication: Necessary and sufficient conditions for a power language to be deterministic

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