X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science, theory & methods (47) 47
computer science (35) 35
mathematics, applied (14) 14
computation by abstract devices (11) 11
artificial intelligence (10) 10
algorithms (9) 9
theory of computation (9) 9
computer science, artificial intelligence (8) 8
computer science, software engineering (8) 8
grammars (8) 8
matematika- és számítástudományok (8) 8
mathematical logic and formal languages (8) 8
mathematics (8) 8
membranes (8) 8
systems (8) 8
természettudományok (8) 8
theoretical computer science (8) 8
algorithm analysis and problem complexity (7) 7
p systems (7) 7
power (7) 7
computation (6) 6
grammar, comparative and general (6) 6
recursively enumerable languages (6) 6
computer science, information systems (5) 5
computer software (5) 5
electronic books (5) 5
evolutionary biology (5) 5
parallel communicating grammar systems (5) 5
processor architectures (5) 5
analysis (4) 4
computational biology/bioinformatics (4) 4
computational completeness (4) 4
computational complexity (4) 4
computational power (4) 4
computers (4) 4
congresses (4) 4
discrete mathematics in computer science (4) 4
electronic data processing (4) 4
engineering & applied sciences (4) 4
formal languages (4) 4
formal languages and automata theory (4) 4
membrane computing (4) 4
membrane systems (4) 4
p automata (4) 4
recursively enumerable language (4) 4
simulation and modeling (4) 4
studies (4) 4
turing machines (4) 4
bioinformatics (3) 3
colonies (3) 3
complexity (3) 3
computer programming (3) 3
cooperation (3) 3
dol systems (3) 3
grammar systems (3) 3
languages (3) 3
mathematical logic (3) 3
networks (3) 3
p colonies (3) 3
p colony (3) 3
strings (3) 3
universality (3) 3
[ info.info-fl ] computer science [cs]/formal languages and automata theory [cs.fl] (2) 2
alternative splicing (2) 2
budapest (2) 2
communication (2) 2
competence (2) 2
completeness (2) 2
computational-complexity (2) 2
computer algorithms (2) 2
computer graphics (2) 2
computer mathematics (2) 2
computer networks (2) 2
computer science - formal languages and automata theory (2) 2
computer science mathematics (2) 2
computer simulation (2) 2
computing methodologies (2) 2
cooperating distributed grammar systems (2) 2
d0l systems (2) 2
data structures (2) 2
descriptional complexity (2) 2
eco-grammar system (2) 2
electrical engineering (2) 2
engineering (2) 2
environment (2) 2
fachgebiet komplexitätstheorie und effiziente algorithmen (2) 2
finite automata (2) 2
foundations (2) 2
herausgeber (2) 2
ilmpub (2) 2
informatics (2) 2
instruments & instrumentation (2) 2
kongress (2) 2
kongressband (2) 2
lindenmayer system (2) 2
lindenmayer systems (2) 2
linguistics (2) 2
math applications in computer science (2) 2
mathematical analysis (2) 2
mathematical logic and foundations (2) 2
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


1994, Topics in computer mathematics, ISBN 2881249574, Volume 5., viii, 246
Book
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, ISSN 0129-0541, 01/2019, Volume 30, Issue 1, pp. 73 - 92
Permitting semi-conditional grammars (pSCGs) are extensions of context-free grammars where each rule is associated with a word w and such a rule can be applied... 
generative power | GRAMMARS | COMPUTER SCIENCE, THEORY & METHODS | Semi-conditional grammars | CONTEXT | permitting context
Journal Article
Fundamenta Informaticae, ISSN 0169-2968, 2017, Volume 155, Issue 1-2, pp. 111 - 129
In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing... 
Mind change | Complementary relation | Red-green Turing machines | Watson-Crick T0L systems | Red-green register machines | COMPUTER SCIENCE, SOFTWARE ENGINEERING | red-green register machines | MATHEMATICS, APPLIED | mind change | red-green Turing machines | DOL SYSTEMS | POWER | D0L SYSTEMS | complementary relation | Number theory | Turing machines
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 11/2013, Volume 24, Issue 7, pp. 995 - 1008
In this paper we provide a summary on important results concerning P automata and their distributed systems, dP automata. Since these constructs combine... 
DP automata | P automata | Membrane systems | COMPUTATIONAL-COMPLEXITY | dP automata | FINITE AUTOMATA | SYSTEMS | POWER | COMPUTER SCIENCE, THEORY & METHODS | membrane systems | LANGUAGES | COMMUNICATION | HIERARCHY
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2005, Volume 330, Issue 2, p. 193
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2005, Volume 330, Issue 2, pp. 193 - 193
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 2014, Volume 25, Issue 4, pp. 391 - 408
P automata are variants of symport/antiport membrane systems which describe string languages by applying a mapping to the sequence of multisets entering the... 
logarithmic workspace | P automata | P systems | COMPUTATIONAL-COMPLEXITY | SYSTEMS | COMPUTER SCIENCE, THEORY & METHODS | Permutations | Membranes | Foundations | Turing machines | Hierarchies | Computation | Mapping | Strings
Journal Article
Language, Life, Limits, ISSN 0302-9743, 2014, Volume 8493, pp. 32 - 41
By analysing the explanation of the classical heapsort algorithm via the method of levels of abstraction mainly due to Floridi, we give a concrete and precise... 
Conference Proceeding
International Journal of Foundations of Computer Science, ISSN 0129-0541, 2013, Volume 24, Issue 5, pp. 547 - 623
Journal Article
Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180, 08/2017, Volume 252
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 01/2011, Volume 22, Issue 1, pp. 203 - 212
We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the... 
Descriptional complexity | Parallel communicating grammar systems | Clusters of agents | Distributed problem solving | descriptional complexity | clusters of agents | COMPUTER SCIENCE, THEORY & METHODS | distributed problem solving
Journal Article
THEORETICAL COMPUTER SCIENCE, ISSN 0304-3975, 01/2010, Volume 411, Issue 4-5, pp. 701 - 701
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 11/2017, Volume 701, pp. 146 - 160
In this paper we consider four restricted cases of the generalised communicating P systems and study their computational power, by providing improved results,... 
Register machine | Generalised communicating P systems | Computational power | Broadcasting problem | Workflow patterns | Comparative operations | P colony | Producer/consumer | COLONIES | ENVIRONMENT | MEMBRANE SYSTEMS | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Electrical engineering | Analysis
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.