Results 21 to 30 of about 4,373 (234)
Computability and human symbolic output [PDF]
, 2013 This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on.
Megill, Jason, Melvin, Tim
core +4 more sources
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise [PDF]
Logical Methods in Computer ScienceAngluin's L$^*$ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous random ...
Lina Ye +7 more
doaj +1 more source
On enhanced time-varying distributed H systems [PDF]
Computer Science Journal of Moldova, 2002 An enhanced time-varying distributed H system (ETVDH system) is a slightly different definition of the time-varying distributed H system (TVDH system) [9] and it was proposed by M. Margenstern and Yu.
Sergey Verlan
doaj
Generating Languages by P Systems with Minimal Symport/Antiport [PDF]
Computer Science Journal of Moldova, 2006 It is known that P systems with two membranes and minimal symport/antiport rules are “almost” computationally complete as generators of number or vector sets.
Artiom Alhazov, Yurii Rogozhin
doaj
Infinite and Bi-infinite Words with Decidable Monadic Theories [PDF]
, 2018 We study word structures of the form $(D,
Kuske, Dietrich +2 more
core +2 more sources
Separating the Classes of Recursively Enumerable Languages Based on Machine Size [PDF]
International Journal of Foundations of Computer Science, 2015 In the late nineteen sixties it was observed that the r.e. languages form an infinite proper hierarchy [Formula: see text] based on the size of the Turing machines that accept them. We examine the fundamental position of the finite languages and their complements in the hierarchy.
Jan van Leeuwen, Jirí Wiedermann
openaire +4 more sources
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems [PDF]
, 2005 We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative integers, even when no region ...
Alhazov, Artiom +2 more
core
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
, 2010 Starting from the fact that complete Accepting Hybrid Networks of Evolutionary Processors allow much communication between the nodes and are far from network structures used in practice, we propose in this paper three network topologies that restrict the
Florin Manea +3 more
core +2 more sources
Systematic Exploration of 3D Concrete Printing Parameters for Conformal Printing on Sloped Surfaces
Advanced Robotics Research, EarlyView.A conformal slicing algorithm is developed for robotic 3D concrete printing (3DCP) on sloped surfaces as a first step toward printing slab‐on‐grade foundations on uneven terrain. Systematic experiments quantify the effects of nozzle speed, extrusion rate, and toolpath direction on filament dimension and stability.
Paniz Farrokhsiar +2 more
wiley +1 more source
On Measuring Non-Recursive Trade-Offs
, 2009 We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.
A. Malcher +29 more
core +4 more sources