Research Article
On Generalized Parikh Matrices for Finite and Infinite Words
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 68 - Issue 15 |
| Published: April 2013 |
| Authors: Huldah Samuel |
10.5120/11658-7175
|
Huldah Samuel . On Generalized Parikh Matrices for Finite and Infinite Words. International Journal of Computer Applications. 68, 15 (April 2013), 37-39. DOI=10.5120/11658-7175
@article{ 10.5120/11658-7175,
author = { Huldah Samuel },
title = { On Generalized Parikh Matrices for Finite and Infinite Words },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 68 },
number = { 15 },
pages = { 37-39 },
doi = { 10.5120/11658-7175 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Huldah Samuel
%T On Generalized Parikh Matrices for Finite and Infinite Words%T
%J International Journal of Computer Applications
%V 68
%N 15
%P 37-39
%R 10.5120/11658-7175
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The concept of the Generalized Parikh Matrices (GPM) of words is introduced in this paper. Some results and properties of the GPM for finite words over ? are discussed. The definition is extended for infinite words too.
References
- R. J. Parikh, On context-free languages, J. Assoe. Comput. Mach. , 13 (1966) 570?581.
- R. Siromoney, V. R. Dare, A generalization of Parikh Vectors for finite and infinite words, Lecture Notes in Computer Science, 206, Springer Verlag, 1985.
- A. Mateescu, A. Salomaa, K. Salomaa, S. Yu, A sharpening of the Parikh mapping, Theoret. Informatics. Appl. , 35 (2001), 551?564.
- K. Sasikala, T. Kalyani, V. R. Dare and P. J. Abisha, Line languages, Electronic Notes in Discrete Mathematics, 12, 2003.
- K. G. Subramanian, Ang Miin Huey and Atulya K. Nagar, On Parikh matrices, International Journal of Foundation of Computer Science, 20(2) (2009), 211?219
Index Terms
Keywords