Language, life, limits : 10th conference on computability in europe, cie 2014, budapest, hungary, june 23-27, 2014. Proceedings / edited by Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer.

Springer eBooks

How can Grammatical Inference Contribute to Computational Linguistics? -- Algorithms and Their Explanations -- Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability -- Uniform Schemata for Proof Rules -- Graph Polynomials Motivated by Gene Rearrangements in Ciliates -- On the Equivalence of Automata for KAT-expressions -- Algorithmic Randomness for Infinite Time Register Machines -- Constraint Logic Programming for Resolution of Relative Time Expressions -- Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries -- Learnability Thesis Does Not Entail Church’s Thesis -- Phase Transitions Related to the Pigeonhole Principle -- Generic Parallel Algorithms -- Fit-Preserving Data Refinement of Mass-Action Reaction Networks -- On Maximal Block Functions of Computable ?-like Linear Orderings -- Lossiness of Communication Channels Modeled by Transducers -- Predicate Characterizations in the Polynomial-Size Hierarchy -- Function Spaces for Second-Order Polynomial Time -- Complexity of Operation Problems.

Para consulta fuera de la UANL se requiere clave de acceso remoto.