A note on the number of states of the De Remer's recognizer

DOI10.1016/0020-0190(73)90021-5zbMath0257.68063OpenAlexW2018627789MaRDI QIDQ2559269

Jiri Demner, Jaroslav Král'

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0020-0190(73)90021-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the relationship between the LL(k) and LR(k) grammars ⋮ Simple chain grammars and languages

Cites Work

• Properties of deterministic top-down grammars
• Simple LR(k) grammars

This page was built for publication: A note on the number of states of the De Remer's recognizer