1,675 research outputs found

    Generalized P Colony Automata and Their Relation to P Automata

    Get PDF
    We investigate genPCol automata with input mappings that can be realized through the application of finite transducers to the string representations of multisets. We show that using unrestricted programs, these automata characterize the class of recursively enumerable languages. The same holds for systems with all-tape programs, having capacity at least two. In the case of systems with com-tape programs, we show that they characterize language classes which are closely related to those characterized by variants of P automata

    P Colony Automata with LL(k)-like Conditions

    Get PDF
    We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages characterized by (generalized) P colony automata. We de ne a class of P colony automata satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages

    Deterministic Parsing with P Colony Automata

    Get PDF

    On the Classes of Languages Characterized by Generalized P Colony Automata

    Get PDF
    We study the computational power of generalized P colony automata and show how it is in uenced by the capacity of the system (the number of objects inside the cells of the colony) and the types of programs which are allowed to be used (restricted and unrestricted com-tape and all-tape programs, or programs allowing any kinds of rules)

    Reliable Cellular Automata with Self-Organization

    Full text link
    In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2 dimensions, and this solution can be used to construct a simple 3-dimensional discrete-time universal fault-tolerant cellular automaton. This technique does not help much to solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3; computing in any dimension with non-synchronized transitions. Our more complex technique organizes the cells in blocks that perform a reliable simulation of a second (generalized) cellular automaton. The cells of the latter automaton are also organized in blocks, simulating even more reliably a third automaton, etc. Since all this (a possibly infinite hierarchy) is organized in ``software'', it must be under repair all the time from damage caused by errors. A large part of the problem is essentially self-stabilization recovering from a mess of arbitrary size and content. The present paper constructs an asynchronous one-dimensional fault-tolerant cellular automaton, with the further feature of ``self-organization''. The latter means that unless a large amount of input information must be given, the initial configuration can be chosen homogeneous.Comment: 166 pages, 17 figure

    Sistemas auto-organizados: propriedades fundamentais

    Get PDF
    A set of fundamental properties of self-organised systems is identified. Asynchronism is here proposed as one of these properties. It is shown that, by overlooking it, the concept of self-organisation is not fulfilled. Implications of this property to the study of selforganisation are discussed. Further, two other salient aspects are identified: minimisation of local conflicts produces optimal evolutionarily stable self-organisation; and the hypothesis that complexity variations may distinguish living from non-living self-organised systems. Conclusions and further research bring the document to an end.Neste artigo identifica-se um conjunto de propriedades fundamentais que caracterizam os sistemas auto-organizados. Propõe-se o assincronismo como uma dessas propriedades. Mostra-se que sistemas sem assincronismo não se podem considerar autoorganizados. Discutem-se as implicações desta propriedade para o estudo da autoorganização. Para além disso, identificam-se dois outros aspectos notáveis: a minimização de conflitos locais produz auto-organização óptima e evolucionariamente estável; e a hipótese de que as variações de complexidade permitem distinguir sistemas auto-organizados vivos dos não vivos. O documento termina com as principais conclusões e perspectivas de investigação futura.peerreviewe
    corecore