default search action
Adrian Atanasiu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j23]Adrian Atanasiu, Ghajendran Poovanandran
, Abdalhadi Abu Zeyneh, Wen Chean Teh
Erasure and error correcting ability of Parikh matrices. Inf. Process. Lett. 175: 106223 (2022) - 2021
- [j22]Wen Chean Teh
Freeness Problem for Matrix Semigroups of Parikh Matrices. Fundam. Informaticae 179(4): 385-397 (2021) - 2020
- [j21]Wen Chean Teh
Simulation of reaction systems by the strictly minimal ones. J. Membr. Comput. 2(3): 162-170 (2020) - [i2]Wen Chean Teh, Adrian Atanasiu:
Simulation Of Reaction Systems By The Strictly Minimal Ones. CoRR abs/2002.09033 (2020)
2010 – 2019
- 2019
- [j20]Adrian Atanasiu, Ghajendran Poovanandran
Parikh matrices for powers of words. Acta Informatica 56(6): 521-535 (2019) - [c10]Adrian Atanasiu, Ghajendran Poovanandran
Parikh Determinants. WORDS 2019: 68-79 - 2018
- [j19]Wen Chean Teh
On strongly M-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices. Theor. Comput. Sci. 719: 86-93 (2018) - [i1]Ghajendran Poovanandran, Adrian Atanasiu, Wen Chean Teh:
Parikh Motivated Study on Repetitions in Words. CoRR abs/1807.06171 (2018) - 2017
- [j18]Wen Chean Teh
Minimal Reaction Systems Revisited and Reaction System Rank. Int. J. Found. Comput. Sci. 28(3): 247-262 (2017) - [j17]Wen Chean Teh
Irreducible reaction systems and reaction system rank. Theor. Comput. Sci. 666: 12-20 (2017) - 2016
- [j16]Adrian Atanasiu, Wen Chean Teh
A New Operator over Parikh Languages. Int. J. Found. Comput. Sci. 27(6): 757-770 (2016) - [j15]Wen Chean Teh
On a conjecture about Parikh matrices. Theor. Comput. Sci. 628: 30-39 (2016) - 2014
- [c9]Adrian Atanasiu:
Parikh Matrix Mapping and Amiability Over a Ternary Alphabet. Discrete Mathematics and Computer Science 2014: 1-12 - [c8]Adrian Atanasiu, Kalpana Mahalingam, K. G. Subramanian:
Morphisms and Weak-Ratio Property. Discrete Mathematics and Computer Science 2014: 13-21 - 2013
- [j14]Adrian Atanasiu, Radu-Florian Atanasiu:
Enriching Parikh matrix mappings. Int. J. Comput. Math. 90(3): 511-521 (2013) - [j13]Adrian Atanasiu:
A New Batch Verifying Scheme for Identifying Illegal Signatures. J. Comput. Sci. Technol. 28(1): 144-151 (2013) - 2010
- [j12]Adrian Atanasiu:
Parikh Matrices, Amiability and Istrail Morphism. Int. J. Found. Comput. Sci. 21(6): 1021-1033 (2010)
2000 – 2009
- 2008
- [j11]Adrian Atanasiu, Radu-Florian Atanasiu, Ion Petre
Parikh matrices and amiable words. Theor. Comput. Sci. 390(1): 102-109 (2008) - 2007
- [j10]Adrian Atanasiu:
Binary amiable Words. Int. J. Found. Comput. Sci. 18(2): 387-400 (2007) - [c7]Adrian Atanasiu, K. G. Subramanian, K. Rangarajan, Patrick S. P. Wang:
Finite Array Automata and Regular Array Grammars. Formal Models, Languages and Applications 2007: 1-16 - 2003
- [j9]Adrian Atanasiu, Carlos Martín-Vide, Victor Mitrana
On the sentence valuation in a semiring. Inf. Sci. 151: 107-124 (2003) - 2002
- [j8]Adrian Atanasiu, Carlos Martín-Vide:
Recursive Calculus with Membranes. Fundam. Informaticae 49(1-3): 45-59 (2002) - [j7]Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu:
On the Injectivity of the Parikh Matrix Mapping. Fundam. Informaticae 49(4): 289-299 (2002) - [c6]Adrian Atanasiu:
Authentication of Messages Using P Systems. WMC-CdeA 2002: 33-42 - 2001
- [j6]Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu:
Codifiable Languages and the Parikh Matrix Mapping. J. Univers. Comput. Sci. 7(8): 783-793 (2001) - [c5]Adrian Atanasiu:
Trellis languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 187-198 - 2000
- [c4]Adrian Atanasiu:
Oracles for Binary Words. Recent Topics in Mathematical and Computational Linguistics 2000: 1-10 - [c3]Adrian Atanasiu, Carlos Martín-Vide, Victor Mitrana:
On the Sentence Valuations in a Semiring. Words, Languages & Combinatorics 2000: 22-39
1990 – 1999
- 1999
- [c2]Adrian Atanasiu, Victor Mitrana:
About Symbolic Encryption: Separable Encryption Systems. Grammatical Models of Multi-Agent Systems 1999: 218-225 - 1998
- [j5]Adrian Atanasiu:
A Mathematical Model of Evolutionary Systems. Sci. Ann. Cuza Univ. 7: 43-54 (1998) - 1994
- [p1]Adrian Atanasiu:
Substitution on Words and Languages: Applications to Cryptography. Mathematical Aspects of Natural and Formal Languages 1994: 1-12 - 1993
- [j4]Adrian Atanasiu, Victor Mitrana:
Parallel Substitution on Words and Languages. Sci. Ann. Cuza Univ. 2: 37-44 (1993) - [c1]Adrian Atanasiu, Victor Mitrana:
Substitution on Words and Languages. Developments in Language Theory 1993: 51-59 - 1992
- [j3]Adrian Atanasiu:
A Class of Coders Based on GSM. Acta Informatica 29(8): 779-791 (1992)
1980 – 1989
- 1980
- [j2]Adrian Atanasiu:
Tree-codifications and convolutional codes. Fundam. Informaticae 3(4): 401-418 (1980)
1970 – 1979
- 1977
- [j1]Adrian Atanasiu:
C-Grammars and Tree-Codifications. J. Comput. Syst. Sci. 15(1): 111-120 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: