scispace - formally typeset
Search or ask a question
Topic

Indexed language

About: Indexed language is a research topic. Over the lifetime, 334 publications have been published within this topic receiving 11000 citations.


Papers
More filters
01 Jan 1989
TL;DR: A characterization of the K(O) languages is given in terms of the simple deterministic languages and these classes of languages are compared with other classes of Languages, such as the U(1) languages and the U?(O).
Abstract: Several definitions of the U(R) grammars can be found in the literature. Since the left-corner grammars can be defined as a restricted class of LR( k) grammars, there are also several definitions of the LC( k) grammars. Two such definitions are compared. For the case k = 0, these definitions are not equivalent. A characterization of the K(O) languages is given in terms of the simple deterministic languages and these classes of languages are compared with other classes of languages, such as the U(1) languages and the U?(O) languages.
01 Jan 2002
TL;DR: A full operational framework is provided, that allows us to transform tree grammars into Prolog programs (as it already exists for word Grammars with DCG) whose goal is to recognize terms of the corresponding language.
Abstract: Tree languages are powerful tools for the representation and schematization of infinite sets of terms for various purposes (unification theory, verification and specification ...). In order to extend the regular tree language framework, more complex formalisms have been developed. In this paper, we focus on Tree Synchronized Grammars and Primal Grammars which introduce specific control structures to represent non regular sets of terms. We propose a common unified framework in order to achieve the membership test for these particular languages. Thanks to a proof system, we provide a full operational framework, that allows us to transform tree grammars into Prolog programs (as it already exists for word grammars with DCG) whose goal is to recognize terms of the corresponding language.
Proceedings ArticleDOI
27 Jun 2004
TL;DR: From the perspective of generating languages, regular quantum grammars are not more powerful than classical regular grammar, which implies that it may be necessary to look for more well-formed definitions of quantum Grammars and maybe those of quantum automata.
Abstract: To study quantum computation, Moore and Crutchfield (Theoret. Comput. Sci. vol. 237, pp. 275-306, 2000) proposed quantum versions of finite-state and push-down automata, as well as regular and context-free grammars. In this note, we show that the languages generated by regular quantum grammars are equivalent to the languages generated by regular grammars. Therefore, from the perspective of generating languages, regular quantum grammars are not more powerful than classical regular grammars. This implies that it may be necessary to look for more well-formed definitions of quantum grammars and maybe those of quantum automata.

Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
76% related
Finite-state machine
15.1K papers, 292.9K citations
76% related
Logic programming
11.1K papers, 274.2K citations
75% related
Type (model theory)
38.9K papers, 670.5K citations
74% related
Concurrency
13K papers, 347.1K citations
74% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20211
20195
20182
20177
201615
20157