Journal ArticleDOI
Terminal weighted grammars and picture description
Kamala Krithivasan,Anindya Das +1 more
Reads0
Chats0
TLDR
A terminal weighted grammar is defined, where the terminal generated at any step of a derivation is defined as a function of time, and it is seen that terminal weighted regular grammars generate exactly the class of recursively enumerable sets.Abstract:
Motivated by the idea of describing parquet deformations using grammars and also of describing an infinite number of terminals starting with only a finite set, this paper defines a terminal weighted grammar, where the terminal generated at any step of a derivation is defined as a function of time It is seen that terminal weighted regular grammars generate exactly the class of recursively enumerable sets Terminal weighted matrix grammars are used to describe parquet deformations The extension of terminal weights to array grammars is also discussedread more
Citations
More filters
Journal ArticleDOI
Picture processing: 1985
TL;DR: A bibliography of nearly 1100 references related to the computer processing of pictorial information, arranged by subject matter is presented, to provide a convenient compendium of references.
Journal ArticleDOI
Some results on time-varying and relativised cellular automata
Meena Mahajan,Kamala Krithivasan +1 more
TL;DR: In this paper, the recognition capabilities of CA and TVCA are compared, and the power of this implicit query mechanism is compared with the traditional oracle access in Turing machines.
Journal ArticleDOI
Time varying finite automata
Kamala Krithivasan,Anindya Das +1 more
TL;DR: This paper considers two machine models equivalent in power to Turing machines and shows their equivalence to terminal weighted regular grammars, thus proving that time varying generalized finite automata have the same power as Turing machines.
Journal ArticleDOI
Time varying pushdown automata
Kamala Krithivasan,V. Srinivasan +1 more
TL;DR: It is seen that periodically time varying pushdown automata accept exactly the class of context-free languages.
Book ChapterDOI
Pictures and Chomsky Languages in Array P System
TL;DR: The regulated evolution of this new model is capable of generating interesting pictures in its accepting mode of evolution and the relationship between the family of regulating languages of 8-directional array P system and theFamily of \(\lambda \)-free regular, context-free, context to context-sensitive languages is investigated.
References
More filters
Journal ArticleDOI
A formal picture description scheme as a basis for picture processing systems
TL;DR: A formal picture description scheme to be used as the basis for picture processing systems is presented and a series of examples illustrate the capability and limitations of the description scheme.
Journal ArticleDOI
Abstract families of matrices and picture languages
TL;DR: A linguistic model to generate matrices (arrays of terminals) is presented and immediate application is shown in picture processing by generating a wide class of interesting pictures.
Journal ArticleDOI
Picture languages with array rewriting rules
TL;DR: Generative models of picture languages with array rewriting rules are presented and each letter of the alphabet of different sizes can be generated by a context-free array grammar.
Journal ArticleDOI
Array Grammars and Kolam
TL;DR: Kolam designs of South Indian folk art are treated as examples of two-dimensional picture languages, and many of the complicated kolain patterns are seen to be generable by context-free array grammars.