Rani Siromoney

Chennai Mathematical Institute

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

K. G. Subramanian

Liverpool Hope University

V. R. Dare

Chennai Mathematical Institute

Gift Siromoney

Lisa Mathew

Amal Jyothi College of Engineering

Kamala Krithivasan

Indian Institute of Technology Madras

Henning Fernau

Universität Trier

Rudolf Freund

TU Wien

D. G. Thomas

Saveetha University

K. G. Subramanian

T. Robinson

Christian Medical College & Hospital

Cooperative Institutions

Centre National de la Recherche Scientifique

Anna University, Chennai

Université Paris Cité

Western University

Liverpool Hope University

Academy of Sciences of Moldova

Vellore Institute of Technology University

University of Tübingen

Sri Venkateswara University

Laboratoire Bordelais de Recherche en Informatique

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Extended controlled table L-arrays

Information and Control (1977)

Rani Siromoney Gift Siromoney

Table (database)

Generative model

10.1016/s0019-9958(77)90337-0

Cite

Citations (46)

On identifying DNA splicing systems from examples

Lecture notes in computer science (1992)

Yuji Takada Rani Siromoney

Deterministic finite automaton

10.1007/3-540-56004-1_21

Cite

Citations (6)

Syntactic Methods: SSPR’90 Working Group Report

Springer eBooks (1992)

Rani Siromoney Alberto Sanfeliu

10.1007/978-3-642-77281-8_33

Cite

Citations (0)

A characterization of semilinear sets

Proceedings of the American Mathematical Society (1969)

Rani Siromoney

Introduction. The recent interest in the structure of programming languages has led to the study of their mathematical properties. Characterizations of bounded context-free languages (also called bounded ALGOL-like languages) [1] and bounded regular sets [3] have been given in terms of certain semilinear subsets of Nn. Semilinear sets have been extensively studied as subsets of lattice points in n-space which are finite unions of cosets of finitely generated subsemigroups of the set of all lattice points with nonnegative coordinates and which are also shown to be equivalent to the family of sets defined by modified Presburger formulas [2]. In this note we give a characterization and discuss decision procedures for semilinear sets of words (hereafter called semilinear sets) [4] which include bounded context-free languages and hence bounded regular sets.

Characterization

10.1090/s0002-9939-1969-0239891-9

Cite

Citations (9)

MAP SYSTEMS WITH HANDLES

WORLD SCIENTIFIC eBooks (1989)

Gift Siromoney K. G. Subramanian Rani Siromoney

10.1142/9789814368452_0019

Cite

Citations (1)

Control on kolam arrays

Information and Control (1976)

Rani Siromoney K. G. Subramanian K. Rangarajan

10.1016/s0019-9958(76)90257-6

Cite

Citations (9)

Parallel/sequential rectangular arrays with tables

International Journal of Computer Mathematics (1977)

Rani Siromoney K. G. Subramanian K. Rangarajan

Parallel/sequential generative models with tables are introduced and properties studied. These have higher generative capacity than our earlier matrix models which extend the essence of restricted parallelism to two dimensional grammars. The effects of appearance checking, minimal table and control are examined. The Szilard language of the vertical grammars is shown to be regular.

Table (database)

10.1080/00207167708803133

Cite

Citations (43)

A Characterization of Semilinear Sets

Proceedings of the American Mathematical Society (1969)

Rani Siromoney

Characterization

10.2307/2036448

Cite

Citations (4)

Advances in array languages