In Memoriam, Solomon Marcus
| dc.contributor.editor | Calude, Cristian S. | |
| dc.contributor.editor | Păun, Gheorghe | |
| dc.date.accessioned | 2022-05-06T11:32:04Z | |
| dc.date.available | 2022-05-06T11:32:04Z | |
| dc.date.issued | 2022 | |
| dc.identifier | ONIX_20220506_9783036534756_224 | |
| dc.identifier.uri | https://directory.doabooks.org/handle/20.500.12854/81158 | |
| dc.description.abstract | 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. | |
| dc.language | English | |
| dc.subject.classification | thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries | en_US |
| dc.subject.classification | thema EDItEUR::U Computing and Information Technology::UY Computer science | en_US |
| dc.subject.other | automata theory | |
| dc.subject.other | formal language theory | |
| dc.subject.other | bio-informatics | |
| dc.subject.other | recursive function theory | |
| dc.subject.other | evolutionary processor | |
| dc.subject.other | network of evolutionary processors | |
| dc.subject.other | network topology | |
| dc.subject.other | theory of computation | |
| dc.subject.other | computational models | |
| dc.subject.other | intrinsic perception | |
| dc.subject.other | Hausdorff dimension | |
| dc.subject.other | fractal | |
| dc.subject.other | computational complexity | |
| dc.subject.other | Turing machine | |
| dc.subject.other | oracle Turing machine | |
| dc.subject.other | shortest computations | |
| dc.subject.other | quasiperiod | |
| dc.subject.other | formal language | |
| dc.subject.other | asymptotic growth | |
| dc.subject.other | polynomial | |
| dc.subject.other | membrane computing | |
| dc.subject.other | computational complexity theory | |
| dc.subject.other | P vs. NP problem | |
| dc.subject.other | evolutional communication | |
| dc.subject.other | symport/antiport | |
| dc.subject.other | Kolmogorov complexity | |
| dc.subject.other | random strings | |
| dc.subject.other | extractors | |
| dc.subject.other | finite languages | |
| dc.subject.other | deterministic finite cover automata | |
| dc.subject.other | multiple entry automata | |
| dc.subject.other | automata with “do not care” symbols | |
| dc.subject.other | similarity relations | |
| dc.subject.other | process calculus | |
| dc.subject.other | communication patterns | |
| dc.subject.other | control structures | |
| dc.subject.other | hypergraph model | |
| dc.subject.other | P systems | |
| dc.subject.other | cP systems | |
| dc.subject.other | NP-complete | |
| dc.subject.other | NP-hard | |
| dc.subject.other | SAT | |
| dc.subject.other | logarithmic time complexity | |
| dc.title | In Memoriam, Solomon Marcus | |
| dc.type | book | |
| oapen.identifier.doi | 10.3390/books978-3-0365-3476-3 | |
| oapen.relation.isPublishedBy | 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 | |
| oapen.relation.isbn | 9783036534756 | |
| oapen.relation.isbn | 9783036534763 | |
| oapen.pages | 148 | |
| oapen.place.publication | Basel |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||

