Book ChapterDOI
Balanced grammars and their languages
Jean Berstel,Luc Boasson +1 more
Reads0
Chats0
TLDR
It is shown that there exists a unique minimal balanced grammar equivalent to a given one and balanced languages are characterized through a property of their syntactic congruence.Abstract:
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.read more
Citations
More filters
Proceedings ArticleDOI
Visibly pushdown languages
Rajeev Alur,P. Madhusudan +1 more
TL;DR: This framework explains, unifies, and generalizes many of the decision procedures in the program analysis literature, and allows algorithmic verification of recursive programs with respect to many context-free properties including access control properties via stack inspection and correctness of procedures withrespect to pre and post conditions.
Journal ArticleDOI
Taxonomy of XML schema languages using formal language theory
TL;DR: This work presents a formal framework for XML schema languages based on regular tree grammars that helps to describe, compare, and implement such schema languages in a rigorous manner.
Journal ArticleDOI
Adding nesting structure to words
Rajeev Alur,P. Madhusudan +1 more
TL;DR: In this paper, the authors define nested word automata, which generalize both words and ordered trees, and allow both word and tree operations, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nestedword automata are as expressive as their non-deterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-a, prefixes, and language homomorphisms; membership, emptiness, language equivalence are all decidable;
Book ChapterDOI
Adding nesting structure to words
Rajeev Alur,P. Madhusudan +1 more
TL;DR: A class of regular languages of nested words has all the appealing theoretical properties that the class of classical regular word languages enjoys: deterministic nested word automata are as expressive as their nondeterministic counterparts; the class is closed under operations such as union, intersection, complementation, concatenation, and Kleene-*.
Journal ArticleDOI
Complexity of input-driven pushdown automata
Alexander Okhotin,Kai Salomaa +1 more
TL;DR: Various aspects of the complexity of input-driven pushdown automata are reported, such as their descriptional complexity, the computational complexity of their membership problem and of other decision problems for input- driven languages.
References
More filters
Journal Article
Extensible Markup Language (XML).
TL;DR: XML is an extremely simple dialect of SGML which is completely described in this document, to enable generic SGML to be served, received, and processed on the Web in the way that is now possible with HTML.
Book
Introduction to formal language theory
TL;DR: This volume intended to serve as a text for upper undergraduate and graduate level students and special emphasis is given to the role of algebraic techniques in formal language theory through a chapter devoted to the fixed point approach to the analysis of context-free languages.
Book ChapterDOI
The Algebraic Theory of Context-Free Languages*
TL;DR: This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial languages of various kinds.
Proceedings ArticleDOI
Simple deterministic languages
A. J. Korenjak,John E. Hopcroft +1 more
TL;DR: The s-languages are those languages recognized by a particular restricted form of deterministic pushdown automaton, called an s-machine, and it is shown that they have the prefix property, and that they include the regular sets with end-markers.