scientific article

zbMath0493.68078MaRDI QIDQ3956424

No author found.

Publication date: 1982

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

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

zbMATH Keywords

context-free languagesPost correspondence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Context-Freeness of Parsing Expression Languages is Undecidable

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Languages with homomorphic replacements
• Reversal-bounded multipushdown machines
• Iterated deterministic-substitution
• The DOL-ness for context-free languages is decidable
• One way finite visit automata
• Checking automata and one-way stack languages
• Stack Machines and Classes of Nonnested Macro Languages
• A note on undecidable properties of formal languages
• Indexed Grammars—An Extension of Context-Free Grammars
• An Infinite Hierarchy of Context-Free Languages
• Two Families of Languages Related to ALGOL
• On the translation of languages from left to right

This page was built for publication: