Adrian Atanasiu

Abdalhadi Abu Zeyneh

Inf. Process. Lett., 2022

2021

Freeness Problem for Matrix Semigroups of Parikh Matrices.

[BibT_eX]

[DOI]

Denis Chee-Keong Wong

Fundam. Informaticae, 2021

2020

Simulation of reaction systems by the strictly minimal ones.

[BibT_eX]

[DOI]

J. Membr. Comput., 2020

2019

Parikh matrices for powers of words.

[BibT_eX]

[DOI]

Acta Informatica, 2019

Parikh Determinants.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

On strongly <i>M</i>-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Parikh Motivated Study on Repetitions in Words.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Irreducible reaction systems and reaction system rank.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Minimal Reaction Systems Revisited and Reaction System Rank.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

2016

On a conjecture about Parikh matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A New Operator over Parikh Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

2014

Morphisms and Weak-Ratio Property.

[BibT_eX]

Kalpana Mahalingam

K. G. Subramanian

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

Parikh Matrix Mapping and Amiability Over a Ternary Alphabet.

[BibT_eX]

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

A New Batch Verifying Scheme for Identifying Illegal Signatures.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2013

Enriching Parikh matrix mappings.

[BibT_eX]

[DOI]

Radu-Florian Atanasiu

Int. J. Comput. Math., 2013

2010

Parikh Matrices, Amiability and Istrail Morphism.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

2008

Parikh matrices and amiable words.

[BibT_eX]

[DOI]

Radu-Florian Atanasiu

Ion Petre

Theor. Comput. Sci., 2008

2007

Binary amiable Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Finite Array Automata and Regular Array Grammars.

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2003

On the sentence valuation in a semiring.

[BibT_eX]

[DOI]

Inf. Sci., 2003

2002

On the Injectivity of the Parikh Matrix Mapping.

[BibT_eX]

[DOI]

Alexandru Mateescu

Fundam. Informaticae, 2002

Recursive Calculus with Membranes.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

Authentication of Messages Using P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, International Workshop, 2002

2001

Codifiable Languages and the Parikh Matrix Mapping.

[BibT_eX]

[DOI]

Alexandru Mateescu

J. Univers. Comput. Sci., 2001

Trellis languages.

[BibT_eX]

Proceedings of the Where Mathematics, 2001

2000

On the Sentence Valuations in a Semiring.

[BibT_eX]

Proceedings of the International Colloquium on Words, 2000

Oracles for Binary Words.

[BibT_eX]

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999

About Symbolic Encryption: Separable Encryption Systems.

[BibT_eX]

Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

1998

A Mathematical Model of Evolutionary Systems.

[BibT_eX]

Sci. Ann. Cuza Univ., 1998

1994

Substitution on Words and Languages: Applications to Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993

Parallel Substitution on Words and Languages.

[BibT_eX]

Sci. Ann. Cuza Univ., 1993

Substitution on Words and Languages.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1992

A Class of Coders Based on GSM.

[BibT_eX]

[DOI]

Acta Informatica, 1992

1980

Tree-codifications and convolutional codes.

[BibT_eX]

Fundam. Informaticae, 1980

1977

C-Grammars and Tree-Codifications.

[BibT_eX]

[DOI]