Nest sets and relativized closure properties

DOI10.1016/0304-3975(83)90106-8zbMath0497.68045OpenAlexW2049652445MaRDI QIDQ1170892

Masako Takahashi

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90106-8

zbMATH Keywords

closure properties under relativized operationsgeneralized parenthesis languageslanguage generated by a context-free grammarone-dimensional expressions of the recognizable sets of binary treesrelativized versions of AFL operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

The equivalence and inclusion problems for NTS languages ⋮ Unnamed Item ⋮ Generalized parenthesis languages and minimization of their parenthesis parts ⋮ Remarques sur les langages de parenthèses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bracketed context-free languages
• The algebra of topology
• Superdeterministic PDAs
• Generalizations of regular sets and their application to a study of context-free languages
• Parenthesis Grammars

This page was built for publication: Nest sets and relativized closure properties