( en | de | ru )

 

Disambiguation of "Mitrana, Victor"

Author of the publication

copydeleteadd this publication to your clipboard
Some Complexity Aspects of Hybrid Networks of Evolutionary Processors.

. DCFS, page 53-65. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Victor Anspach

Status quo, Perspektiven und wirtschaftliche Potenziale der Biogaserzeugung auf landwirtschaftlichen Betrieben im ökologischen Landbau. Uni Kassel, (2009)

Victor Levchenko

Victor Gerds

Victor Zebe

Victor Grigoriev

 

Other publications of authors with the same name

A New-Old Class of Linguistically Motivated Regulated Grammars., , , and . CLIN, volume 37 of Language and Computers - Studies in Practical Linguistics, page 111-125. Rodopi, (2000)Some undecidable problems for parallel communicating finite automata systems., and . Inf. Process. Lett., 77 (5-6): 239-245 (2001)Valence grammars on a free generated group.. Bulletin of the EATCS, (1992)Parallel Finite Automata Systems Communicating by States., , and . Int. J. Found. Comput. Sci., 13 (5): 733-749 (2002)All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size., and . Inf. Process. Lett., 103 (3): 112-118 (2007)Prefix-suffix square reduction., , and . Theor. Comput. Sci., (2017)Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages., , and . Theory Is Forever, volume 3113 of Lecture Notes in Computer Science, page 60-67. Springer, (2004)Contextual Information Systems., and . CONTEXT, volume 3554 of Lecture Notes in Computer Science, page 304-315. Springer, (2005)Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages., and . WMP, volume 2235 of Lecture Notes in Computer Science, page 135-146. Springer, (2000)All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size., , and . DNA, volume 4287 of Lecture Notes in Computer Science, page 47-57. Springer, (2006)