New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
نویسنده
چکیده
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class the DI-grammars cover unbound dependencies in a rather natural way. The place of DI-languages in the Chomsky-hierarchy will be determined: Like Aho's indexed Languages, DI-languages represent a proper subclass of Type 1 (contextsensitive languages) and properly include Type 2 (context-free languages), but the DI-class is neither a subclass nor a superclass of Aho's indexed class. It will be shown that, apart from DI-grammars, DI-languages can equivalently be characterized by a special type of automata DI-automata. Finally, the time complexity of the recognition-problem for an interesting subclass of DI-Grammars will approximately be determined.
منابع مشابه
Hyperedge Replacement Languages and Pushdown Automata
In this paper we are studying the relations between generated and accepted hyperedge replacement languages. In context freeness of hyperedge replacement grammars we can transform each grammar into an equivalent one in Greibach Normal Form (HRGNF). In order to create a pushdown automata for hyperedge replacement languages (PDAH) we build an algorithm to transform the planar structure of a hyperg...
متن کاملList automata with syntactically structured output
A new type of abstract automaton is introduced, and both formal and linguistic implications are discussed, most importantly a new possibility of proving certain formal properties of (natural) languages and their grammars (such as context-freeness) and of refinement of the Chomsky hierarchy.
متن کاملBisimulation of Context-free Grammars and of Pushdown Automata
We consider the bisimulation on the transition graphs of pushdown automata. First we give a characterization of bisimulation using the unfolded trees. We recall that the bisimulation is decidable for the subclass of preex transition graphs of context-free grammars. Furthermore any pushdown transition graph is a regular graph: it can be generated by iterated parallel rewritings of a deterministi...
متن کاملParsing of Context Free Languages
Parsing is the process of assigning structure to sentences The structure is obtained from the grammatical description of the language Both in Com puter Science and in Computational Linguistics context free grammars and associated parsing algorithms are among the most useful tools Numerous parsing algorithms have been developed Special subclasses of the context free grammars have been introduced...
متن کاملAbout Graph and Hypergraph Context Free Grammars
The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent. Key-Words: Hyperedge Replac...
متن کامل