Balanced Grammars and Their Languages [chapter]

Jean Berstel, Luc Boasson
2002 Lecture Notes in Computer Science  
Balanced grammars are a generalization of parenthesis grammars in two directions. First, several kind of parentheses are allowed. Next, the set of right-hand sides of productions may be an infinite regular language. XML-grammars are a special kind of balanced grammars. This paper studies balanced grammars and their languages. It is shown that there exists a unique minimal balanced grammar equivalent to a given one. Next, balanced languages are characterized through a property of their syntactic
more » ... congruence. Finally, we show how this characterization is related to previous work of McNaughton and Knuth on parenthesis languages.
doi:10.1007/3-540-45711-9_1 fatcat:n3k5xev62beslascwxvengli5e