Remarques sur les langages de parenthèses

DOI10.1016/0304-3975(84)90040-9zbMath0549.68072OpenAlexW1979486375MaRDI QIDQ800094

Joffroy Beauquier, Luc Boasson, Jean-Michel Autebert, Géraud Sénizergues

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90040-9

zbMATH Keywords

algebraic grammarNTS grammarparenthesis grammarparenthesis language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

The equivalence and inclusion problems for NTS languages ⋮ Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Nest sets and relativized closure properties
• One counter languages and the IRS condition
• Uniformly erasable AFL
• Generalizations of regular sets and their application to a study of context-free languages
• Parenthesis Grammars

This page was built for publication: Remarques sur les langages de parenthèses