scispace - formally typeset
Book ChapterDOI

Binary images, M-vectors, and ambiguity

TLDR
This work introduces the notion of M-vector of a binary word which allows us to have a linear notation in the form of a unique vector representation of the Parikh matrix of the binary word and extends this notion to a binary image treating it as a binary array over a two-symbol alphabet.
Abstract
Mateescu et al (2001) introduced the notion of Parikh matrix of a word as an extension of the well-known concept of Parikh vector of a word. The Parikh matrix provides more numerical information about a word than given by the Parikh vector. Here we introduce the notion of M-vector of a binary word which allows us to have a linear notation in the form of a unique vector representation of the Parikh matrix of the binary word. We then extend this notion of M-vector to a binary image treating it as a binary array over a two-symbol alphabet. This is done by considering the M-vectors of the words in the rows and columns of the array. Among the properties associated with a Parikh matrix, M-ambiguity or simply ambiguity of a word is one which has been investigated extensively in the literature. Here M-ambiguity of a binary array is defined in terms of its M-vector and we obtain conditions for M-ambiguity of a binary array.

read more

Citations
More filters
Journal ArticleDOI

Two-Dimensional Digitized Picture Arrays and Parikh Matrices

TL;DR: This work extends the notion of Parikh matrix of a word to a picture array and associates with it two kinds ofParikh matrices, called row ParikhMatrix and column Parikh Matrix, and obtains conditions that ensure M-ambiguity.
Book ChapterDOI

Application of Ratio Property in Searching of M-Ambiguous Words and Its Generalization

TL;DR: In this paper ratio property of words are investigated and a relationship of ratio property with M-ambiguity is established for nth order alphabet.
References
More filters
Journal ArticleDOI

On Context-Free Languages

TL;DR: In this report, certain properties of context-free (CF or type 2) Grammars are investigated, like that of Chomsky, and it is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammARS that the phrase structure of a grammatical sentence is unique, once the derivation is given.
Journal ArticleDOI

Qualitative Spatial Representation and Reasoning: An Overview

TL;DR: The paper is a overview of the major qualitative spatial representation and reasoning techniques including ontological aspects, topology, distance, orientation and shape, and qualitative spatial reasoning including reasoning about spatial change.
Journal ArticleDOI

A sharpening of the Parikh mapping

TL;DR: A sharpening of the Parikh map- ping is introduced and an interesting in- terconnection between mirror images of words and inverses of matrices is established.
Journal ArticleDOI

Subword histories and Parikh matrices

TL;DR: This paper introduces the closely related notion of a subword history and obtains a sequence of general results: elimination of products, decidability of equivalence, and normal form, and investigates overall-methods for proving the validity of such results.