Associative language descriptions

DOI10.1016/S0304-3975(00)00417-5zbMath0988.68100OpenAlexW2057762628MaRDI QIDQ5958317

A. Cherubini Spoletini, Stefano Crespi Reghizzi, Pierluigi San Pietro

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00417-5

zbMATH Keywords

formal languagesassociative descriptionslocal testability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Tree adjunct grammars
• Associative definition of programming languages
• Operator Precedence Grammars and the Noncounting Property
• Noncounting Context-Free Languages
• The Hardest Context-Free Language
• An Infinite Hierarchy of Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Associative language descriptions