Constructing a realtime deterministic pushdown automaton from a grammar

DOI10.1016/0304-3975(83)90138-XzbMath0514.68076MaRDI QIDQ1051440

Jan Pitti, Amiram Yehudai

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

grammar familyrealtime deterministic pushdown automatonstack uniform

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Context-free grammars: covers, normal forms, and parsing
• The inclusion problem for simple languages
• Economy of description by parsers, DPDA's, and PDA's
• Two decidability results for deterministic pushdown automata
• Strict deterministic grammars
• The equivalence problem for real-time strict deterministic languages
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Real-Time Strict Deterministic Languages

This page was built for publication: Constructing a realtime deterministic pushdown automaton from a grammar