Topic
Chomsky hierarchy
About: Chomsky hierarchy is a research topic. Over the lifetime, 601 publications have been published within this topic receiving 31067 citations. The topic is also known as: Chomsky–Schützenberger hierarchy.
Papers published on a yearly basis
Papers
More filters
••
[...]
TL;DR: A time- and space-efficient incremental arc-consistency algorithm for context-free grammars, investigate when logic combinations of grammar constraints are tractable, and show how to exploit non-constant size Grammars and reorderings of languages.
Abstract: With the introduction of the Regular Membership Constraint, a new line of research has opened where constraints are based on formal languages. This paper is taking the next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise a time- and space-efficient incremental arc-consistency algorithm for context-free grammars, investigate when logic combinations of grammar constraints are tractable, show how to exploit non-constant size grammars and reorderings of languages, and study where the boundaries run between regular, context-free, and context-sensitive grammar filtering.
21 citations
•
TL;DR: The aim of this paper is to bring together two new and powerful tools: on the one hand, the splicing operation as a basic operation on DNA sequences and, on the otherhand, the parallelism and communication features in grammar systems.
Abstract: The aim of this paper is to bring together two new and powerful tools: on the one hand, the splicing operation as a basic operation on DNA sequences and, on the other hand, the parallelism and communication features in grammar systems. As expected, the result of the above combination is a very powerful mechanism, leading to a new characterization of recursively enumerable languages.
20 citations
••
TL;DR: The “trade-offs” between these two mechanisms for defining languages are discussed for both “parallel” rewriting systems from the developmental systems hierarchy and “sequential” rewrites from the Chomsky hierarchy.
Abstract: Given a rewriting system G (its alphabet, the set of productions and the axiom) one can define the language of G by
The "trade-offs" between these two mechanisms for defining languages are discussed for both "parallel" rewriting systems from the developmental systems hierarchy and "sequential" rewriting systems from the Chomsky hierarchy.
20 citations
••
TL;DR: The authors introduced a new type of string rewriting systems called Delimited SRS (DSRS), which are expressive enough to define, in a uniform way, a noteworthy and non trivial class of languages that contains all the regular languages, including the parenthesis languages of Dyck, the language of Lukasiewicz and many others.
Abstract: Whereas there is a number of methods and algorithms to learn regular languages, moving up the Chomsky hierarchy is proving to be a challenging task. Indeed, several theoretical barriers make the class of context-free languages hard to learn. To tackle these barriers, we choose to change the way we represent these languages. Among the formalisms that allow the definition of classes of languages, the one of string-rewriting systems (SRS) has outstanding properties. We introduce a new type of SRS's, called Delimited SRS (DSRS), that are expressive enough to define, in a uniform way, a noteworthy and non trivial class of languages that contains all the regular languages, $$\{a^{n}b^{n}: n \geq 0 \}$$ , $$\{w\in \{a,b\}^{*}:|w|_{a}=|w|_{b}\}$$ , the parenthesis languages of Dyck, the language of Lukasiewicz, and many others. Moreover, DSRS's constitute an efficient (often linear) parsing device for strings, and are thus promising candidates in forthcoming applications of grammatical inference. In this paper, we pioneer the problem of their learnability. We propose a novel and sound algorithm (called LARS) which identifies a large subclass of them in polynomial time (but not data). We illustrate the execution of our algorithm through several examples, discuss the position of the class in the Chomsky hierarchy and finally raise some open questions and research directions.
20 citations
••
01 Sep 2014TL;DR: The generalized powerset construction is used to define a generic (trace) semantics for \(\mathbb{T}\)-automata, and it is shown by numerous examples that it correctly instantiates for some known classes of machines/languages captured by the Chomsky hierarchy.
Abstract: The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer science relating classes of formal languages of primary importance. In this paper we use recent developments on coalgebraic and monad-based semantics to obtain a generic notion of a \(\mathbb{T}\)-automaton, where \(\mathbb{T}\) is a monad, which allows the uniform study of various notions of machines (e.g. finite state machines, multi-stack machines, Turing machines, weighted automata). We use the generalized powerset construction to define a generic (trace) semantics for \(\mathbb{T}\)-automata, and we show by numerous examples that it correctly instantiates for some known classes of machines/languages captured by the Chomsky hierarchy. Moreover, our approach provides new generic techniques for studying expressivity power of various machine-based models.
20 citations