Necessary and sufficient conditions for a power language to be deterministic

DOI10.1080/00207167508803107zbMATH Open0333.68051OpenAlexW1993001370WikidataQ126244890 ScholiaQ126244890MaRDI QIDQ4099223FDOQ4099223

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

• Deterministic context free languages
• Title not available (Why is that?)
• LR-regular grammars - an extension of LR(k) grammars
• A necessary and sufficient condition for a power language to be LL(k)
• 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)