Constructing a realtime deterministic pushdown automaton from a grammar

DOI10.1016/0304-3975(83)90138-XMaRDI QIDQ1051440zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 3735179 (Why is no real title available?)
• scientific article; zbMATH DE number 3605927 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Context-free grammars: covers, normal forms, and parsing
• Economy of description by parsers, DPDA's, and PDA's
• Real-Time Strict Deterministic Languages
• Strict deterministic grammars
• The equivalence problem for real-time strict deterministic languages
• The inclusion problem for simple languages
• Two decidability results for deterministic pushdown automata

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

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