Journal of the ACM (JACM)
Introduction to Formal Language Theory
Introduction to Formal Language Theory
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design
Adding nesting structure to words
Journal of the ACM (JACM)
A grammatical representation of visibly pushdown languages
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Precedence automata and languages
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Towards practical computable functions on context-free languages
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the membership problem for visibly pushdown languages
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A declarative specification of tree-based symbolic arithmetic computations
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
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 congruence. Finally, we show how this characterization is related to previous work of McNaughton and Knuth on parenthesis languages.