Pushdown acceptor forms

DOI10.1016/0304-3975(77)90047-0zbMath0369.68047OpenAlexW2014904561MaRDI QIDQ1243144

Seymour Ginsburg, Edwin H. Spanier

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0304-3975(77)90047-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Strict interpretations of deterministic pushdown acceptors

Cites Work

• Unnamed Item
• On grammar forms with terminal context
• Context-free grammar forms
• EOL forms
• On the form equivalence of L-forms
• Control sets on context-free grammar forms
• The structure of context-free grammatical families
• Substitution of grammar forms
• On strongly equivalent context-free grammar forms
• An Observation on Relative Parsing Time
• Size complexity in context-free grammars forms
• Derivation Complexity in Context-Free Grammar Forms
• Dynamic Syntax Specification Using Grammar Forms

This page was built for publication: Pushdown acceptor forms