Some remarks on the KH algorithm fors-grammars

DOI10.1007/BF01933412zbMath0301.68080MaRDI QIDQ4055220

Derick Wood

Publication date: 1973

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Superdeterministic DPDAs: The method of accepting does affect decision problems ⋮ The equivalence problem for LL- and LR-regular grammars ⋮ On equivalence of grammars through transformation trees ⋮ Synchronizable deterministic pushdown automata and the decidability of their equivalence ⋮ A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars ⋮ An extended direct branching algorithm for checking equivalence of deterministic pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• A Procedure for Checking Equality of Regular Expressions
• A generalised normal form theorem for context-free grammars
• A further note on top-down deterministic languages
• A factor theorem for subsets of a free monoid

This page was built for publication: Some remarks on the KH algorithm fors-grammars