scientific article

zbMath0547.68075MaRDI QIDQ3339311

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

Publication date: 1984

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

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

zbMATH Keywords

parenthesis languagesinverse homomorphismsN.T.S. languagesnest-sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Groups and NTS languages

Cites Work

• Remarques sur les langages de parenthèses
• NTS grammars and Church-Rosser systems
• Nest sets and relativized closure properties
• Generalizations of regular sets and their application to a study of context-free languages
• Parenthesis Grammars

This page was built for publication: