LEADER 03326namaa2200949uu 4500
001 doab81158
003 oapen
005 20220506
006 m o d
007 cr|mn|---annan
008 220506s2022 xx |||||o ||| 0|eng d
020 |a 9783036534756 
020 |a 9783036534763 
020 |a books978-3-0365-3476-3 
024 7 |a 10.3390/books978-3-0365-3476-3  |2 doi 
040 |a oapen  |c oapen 
041 0 |a eng 
042 |a dc 
072 7 |a KNTX  |2 bicssc 
072 7 |a UY  |2 bicssc 
720 1 |a Calude, Cristian S.  |4 edt 
720 1 |a Calude, Cristian S.  |4 oth 
720 1 |a Păun, Gheorghe  |4 edt 
720 1 |a Păun, Gheorghe  |4 oth 
245 0 0 |a In Memoriam, Solomon Marcus 
260 |a Basel  |b MDPI - Multidisciplinary Digital Publishing Institute  |c 2022 
300 |a 1 online resource (148 p.) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
506 0 |a Open Access  |f Unrestricted online access  |2 star 
520 |a This book commemorates Solomon Marcus's fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus's research fields, some of whom have been influenced by his results and/or have collaborated with him. 
540 |a Creative Commons  |f https://creativecommons.org/licenses/by/4.0/  |2 cc  |u https://creativecommons.org/licenses/by/4.0/ 
546 |a English 
650 7 |a Computer science  |2 bicssc 
650 7 |a Information technology industries  |2 bicssc 
653 |a asymptotic growth 
653 |a automata theory 
653 |a automata with "do not care" symbols 
653 |a bio-informatics 
653 |a communication patterns 
653 |a computational complexity 
653 |a computational complexity theory 
653 |a computational models 
653 |a control structures 
653 |a cP systems 
653 |a deterministic finite cover automata 
653 |a evolutional communication 
653 |a evolutionary processor 
653 |a extractors 
653 |a finite languages 
653 |a formal language 
653 |a formal language theory 
653 |a fractal 
653 |a Hausdorff dimension 
653 |a hypergraph model 
653 |a intrinsic perception 
653 |a Kolmogorov complexity 
653 |a logarithmic time complexity 
653 |a membrane computing 
653 |a multiple entry automata 
653 |a network of evolutionary processors 
653 |a network topology 
653 |a NP-complete 
653 |a NP-hard 
653 |a oracle Turing machine 
653 |a P systems 
653 |a P vs. NP problem 
653 |a polynomial 
653 |a process calculus 
653 |a quasiperiod 
653 |a random strings 
653 |a recursive function theory 
653 |a SAT 
653 |a shortest computations 
653 |a similarity relations 
653 |a symport/antiport 
653 |a theory of computation 
653 |a Turing machine 
793 0 |a DOAB Library. 
856 4 0 |u https://directory.doabooks.org/handle/20.500.12854/81158  |7 0  |z Open Access: DOAB: description of the publication 
856 4 0 |u https://mdpi.com/books/pdfview/book/5189  |7 0  |z Open Access: DOAB, download the publication