Generalized parenthesis languages and minimization of their parenthesis parts

DOI10.1016/0304-3975(84)90121-XzbMath0549.68071MaRDI QIDQ800093

Hideki Yamasaki, Masako Takahashi

Publication date: 1984

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

zbMATH Keywords

decidabilityregular setgeneralized parenthesis grammargeneralized parenthesis language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Nest sets and relativized closure properties
• Superdeterministic PDAs
• Generalizations of regular sets and their application to a study of context-free languages
• Regularity and Related Problems for Deterministic Pushdown Automata
• Regular canonical systems
• Parenthesis Grammars
• A characterization of parenthesis languages

This page was built for publication: Generalized parenthesis languages and minimization of their parenthesis parts