MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY-Reference-Cited by-同舟云学术

MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY

Published:2004-04 Issue:02 Volume:15 Page:277-292
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

MATEESCU ALEXANDRU¹,SALOMAA ARTO²

Affiliation:

1. Faculty of Mathematics, University of Bucharest, Academiei, 14, Bucharest, Romania

2. Turku Centre for Computer Science, Lemminkäisenkatu 14, 20520 Turku, Finland

Abstract

The paper investigates inequalities between the numbers of different (scattered) subword occurrences. The Parikh matrix recently introduced is an efficient tool. We give various characterizations for Parikh matrices. Of special interest is the case where the matrix determines the word uniquely. We investigate such matrix unambiguous words. The considerations are extended to concern languages. Several open problems and problem areas are indicated.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054104002418

Reference7 articles.

1. CHARACTERIZATION OF A WORD BY ITS SUBWORDS

2. A sharpening of the Parikh mapping

3. Springer Lecture Notes in Computer Science;Pansiot J. J.,1981

4. On Context-Free Languages

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. M-equivalence of Parikh Matrix over a Ternary Alphabet;Implementation and Application of Automata;2023

2. A Toolkit for Parikh Matrices;Implementation and Application of Automata;2022

3. Certain Distance-Based Topological Indices of Parikh Word Representable Graphs;Journal of Mathematics;2021-05-25

4. Wiener-type indices of Parikh word representable graphs;Ars Mathematica Contemporanea;2021-03-12

5. Parikh Word Representable Graphs and Morphisms;Developments in Language Theory;2021