Zobrazeno 1 - 6
of 6
pro vyhledávání: '"77"'
Autor:
Ronald E. Prather
Publikováno v:
Information and Control. (2):159-171
A structured decomposition theorem for Turing machines is given. The nature of the building blocks and the form of the connections allowed suggest a parallel to the Bohm-Jacopini theorem on structured flowcharts. Thus in a broadest sense, there is ob
Autor:
Victor J. Rayward-Smith
Publikováno v:
Journal of Computer and System Sciences. (1):130-149
A new class of generative grammars called hypergrammars is introduced. They are described as a natural extension of Fischer's macrogrammars. Three modes of derivation, inside-out, outside-in, and unrestricted are considered, and the classes of langua
Autor:
Anton Nijholt
Publikováno v:
Journal of computer and system sciences, 15(1), 99-110. Academic Press Inc.
The notion of a parsable grammar is introduced. A definition of cover is provided which is a generalization of a well-known definition of cover. With this new definition of cover we prove that every parsable grammar is covered by an LR(1) grammar or,
Autor:
Adrian Atanasiu
Publikováno v:
Journal of Computer and System Sciences. (1):111-120
The paper introduces two new concepts, namely C-grammar and tree-codification, based on the theory of formal languages, by means of which we try to exhibit a new aspect of general coding theory. Both linear algebraic coding and convolutional coding a
Autor:
Bernd Reusch
Publikováno v:
Journal of Computer and System Sciences. (2):146-168
This paper presents a method for linear realization of automata when such exists.The basic tools employed are indexed partitions (as a way of writing certain mappings) and predecessor operations. The indexed partitions are studied in some detail and
Autor:
Ming-Kuei Hu, Kuo An Chen
Publikováno v:
Information and Control. (3):196-208
It is known that nonregular languages can be accepted by finite state probabilistic automata. For many years it was not known whether a finite state probabilistic automaton existed that would accept a context sensitive language that is not context fr