Showing papers on "Chomsky hierarchy published in 1994"
TL;DR: New results of research on geometrical properties of complex control systems, the so-called Linguistic Geometry are described, which includes the development of syntactic tools for knowledge representation and reasoning about large-scale hierarchical complex systems.
Abstract: In this paper, we describe new results of research on geometrical properties of complex control systems, the so-called Linguistic Geometry. This research includes the development of syntactic tools for knowledge representation and reasoning about large-scale hierarchical complex systems. It relies on the formalization of search heuristics of high-skilled human experts that have resulted in the development of successful applications in different areas. A hierarchy of subsystems of a complex system, the networks of paths, is represented as a hierarchy of formal languages. In this paper, we investigate transformations of these networks while a system moves from one state to another. The investigation consists of formal, constructive separation of changed and unchanged parts of system representation, the hierarchy of languages. Thus, we address a problem relative to the well-known Frame Problem for planning systems. A partial solution is presented in the form of the theorem about translations of network languages. Formal considerations are illustrated by example of Air Force robotic vehicles.
38 citations
10 citations
06 Nov 1994
TL;DR: The inference process is extended to the class of context-free grammars and Deterministic pushdown automata are induced from samples of context free languages.
Abstract: This paper reports on the induction of context free languages using genetic programming. The focus is on language inference, i.e. the inference of formal languages such as those of the Chomsky hierarchy from positive (and negative) sample strings. In this paper, the inference process is extended to the class of context-free grammars. Deterministic pushdown automata are induced from samples of context free languages. The algorithm is a variation of genetic algorithms using free shaped chromosomes to represent the transition tables of the various automata. >
4 citations
TL;DR: The symmetry (and various types of non-symmetry) in a string of symbols of an alphabet, symmetry with respec to given positions in that string are considered and their place in Chomsky hierarchy in investigated.
Abstract: One examines the symmetry (and various types of non-symmetry) in a string of symbols of an alphabet, symmetry with respec to given positions in that string (possibly occurrences of symbols in another alphabet). The languages containing such symmetric/non-symmetric strings are considered and their place in Chomsky hierarchy in investigated
3 citations
01 Jan 1994
TL;DR: Throughout this book, sentences of formal logic are used to describe properties of words over a finite alphabet A to define a language L, which is the set of all words that have the property described by the sentence.
Abstract: Throughout this book we use sentences of formal logic to describe properties of words over a finite alphabet A. A sentence will thus define a language \(L \subseteq A^{*}\); L is the set of all words that have the property described by the sentence.
2 citations