Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Rani Siromoney"'
Autor:
Rani Siromoney, K. G. Subramanian, Sergiu Ivanov, Rudolf Freund, Henning Fernau, Artiom Alhazov
Publikováno v:
Theoretical Computer Science. 682:5-21
We consider d-dimensional contextual array grammars and investigate their computational power when using various control mechanisms – matrices, regular control languages, and tissue P systems, which work like regular control languages, but may end
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e9da71146140f0277bdf2f11c058950
https://doi.org/10.1016/j.tcs.2017.03.012
https://doi.org/10.1016/j.tcs.2017.03.012
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783319411132
DCFS
Lecture Notes in Computer Science
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.98-110, ⟨10.1007/978-3-319-41114-9_8⟩
DCFS
Lecture Notes in Computer Science
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.98-110, ⟨10.1007/978-3-319-41114-9_8⟩
International audience; We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. For $$d\ge 2$$, d-dimensional contextual array grammars are less powerful than matrix context
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0766d269c38bf1f339b2f54215a42beb
https://doi.org/10.1007/978-3-319-41114-9_8
https://doi.org/10.1007/978-3-319-41114-9_8
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319231105
MCU
MCU
We consider the external variant of non-isometric d-dimensional contextual array grammars with regular control together with local selectors allowing for controlling how d-dimensional arrays are evolving by adjoining rectangular \((d-1)\)-dimensional
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b8d627e644e9f67438764d6c666c807
https://doi.org/10.1007/978-3-319-23111-2_5
https://doi.org/10.1007/978-3-319-23111-2_5
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. 14:525-536
In this paper, the concept of local languages is extended to infinite arrays and ωω-local languages are defined. ωω-recognizable languages of infinite arrays accepted by online tesselation automata are considered. Properties of these languages ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7698d94d108a884713ed1d7a889aa7b5
https://doi.org/10.1142/s0218001400000337
https://doi.org/10.1142/s0218001400000337
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. 13:539-553
Cell-works which are three-dimensional cyclic edge-label controlled OL-systems, were introduced by Lindenmayer. Fracchia and Prusinkiewicz provided cell-work systems using markers to model three-dimensional cellular structures. In this paper, cell-wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd5e66a0a790ec9399843020d6d90056
https://doi.org/10.1142/s021800149900032x
https://doi.org/10.1142/s021800149900032x
Publikováno v:
Pattern Recognition. 32:295-304
Two different types of models called puzzle languages and recognizable picture languages describing digitized pictures in a two-dimensional plane have been introduced in the 1990s. We review here these models, reporting the main results already prove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2ba0afdc5ae4a03cd99c6ed8693a80c
https://doi.org/10.1016/s0031-3203(98)00072-7
https://doi.org/10.1016/s0031-3203(98)00072-7
Autor:
Arul Siromoney, Rani Siromoney
Publikováno v:
Sadhana. 21:317-325
We present our machine learning system, that uses inductive logic programming techniques to learn how to identify transmembrane domains from amino acid sequences. Our system facilitates the use of operators such as ‘contains’, that act on entire
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d514a5a956595d16ddcfbd226c146cbc
https://doi.org/10.1007/bf02745526
https://doi.org/10.1007/bf02745526
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. :763-775
The emptiness problem for non-overlapping Basic puzzle grammars is shown to be decidable. An alternate proof of the decidability of the non-overlapping feature for basic puzzle grammars is given. Hierarchy among the various classes of puzzle language
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0428b3b0e86031858fe5b3d13e8ffe31
https://doi.org/10.1142/s0218001495000316
https://doi.org/10.1142/s0218001495000316
Publikováno v:
Information Processing Letters. 50:101-104
We define an infinite Lyndon word as the limit of an increasing sequence of prefix preserving lyndon words and show that some of the interesting properties of Lyndon words generalize to the infinite case. We construct a queue automaton that recognize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6f9dfc0d70e2e2ad688c56804fb71bd
https://doi.org/10.1016/0020-0190(94)90016-7
https://doi.org/10.1016/0020-0190(94)90016-7
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. :627-639
Learning of certain classes of two-dimensional picture languages is considered in this paper. Linear time algorithms that learn in the limit, from positive data the classes of local picture languages and locally testable picture languages are present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5601fc14cd06bcbc5786f3a8d51d3d1
https://doi.org/10.1142/s0218001494000334
https://doi.org/10.1142/s0218001494000334