Titlebook: Language, Life, Limits; 10th Conference on C Arnold Beckmann,Erzsébet Csuhaj-Varjú,Klaus Meer Conference proceedings 2014 Springer Internat

Mnemonics

飛鏢

https://doi.org/10.1007/978-3-319-08019-2algorithms; automata theory; bio-inspired computation; biological computing; computability theory; comput

Aerophagia

信條

SLING

Graph Polynomials Motivated by Gene Rearrangements in Ciliates,. [Discrete Appl. Math., 2013] propose a graph polynomial abstracting basic features of the assembly process, like the number of segments excised. We show that this . is essentially . a single variable case of the . by Jaeger and . a special case of the . introduced for simple graphs by Traldi and Zulli.

財產(chǎn)

食道

COWER

Algorithmic Randomness for Infinite Time Register Machines,A concept of randomness for infinite time register machines (.s), resembling Martin-L?f-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and that an analogue of van Lambalgen’s theorem holds.

THROB

Deciding the Borel Complexity of Regular Tree Languages,We show that it is decidable whether a given a regular tree language belongs to the class . of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.

Meander

Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY,PORGY is a visual modelling tool, where a system is defined by a strategic graph program. In this paper, we provide an operational semantics for strategic graph programs by means of an abstract machine. The semantics specifies the valid transformation steps, providing a link between the model and its implementation in PORGY.