scientific article

zbMath0468.68090MaRDI QIDQ3922198

Jan Pittl

Publication date: 1981

Full work available at URL: https://eudml.org/doc/28582

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

context-free grammarspushdown automataGreibach normal formstrict deterministic grammarsstack uniform automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Constructing a realtime deterministic pushdown automaton from a grammar

Cites Work

• Unnamed Item
• Unnamed Item
• The inclusion problem for simple languages
• Two decidability results for deterministic pushdown automata
• Strict deterministic grammars
• The equivalence problem for real-time strict deterministic languages
• Parenthesis Grammars
• On the Covering and Reduction Problems for Context-Free Grammars
• Real-Time Strict Deterministic Languages

This page was built for publication: