Results 21 to 30 of about 501 (254)
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
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages [PDF]
Journal of the ACM, 1980 Fixed point languages and equality languages of homomorphisms and dgsm mappings are consid- ered. Some basic properties of these classes of languages are proved, and it is shown how to use them to represent recursively enumerable sets. In particular, very simple languages are introduced which play the same role for the class of recursively enumerable ...
Engelfriet, J., Rozenberg, G.
openaire +1 more source
The Decidability of the Existential Theory of the Poset of Recursively Enumerable Degrees with Jump Relations [PDF]
, 1996 We show that the existential theory of the recursively enumerable degrees in the language L containing predicates for order andn-jump comparability for alln, and constant symbols for least and greatest elements, is decidable.
Lerman, Manuel, Lempp, Steffen
core +1 more source
Characterizing language identification by standardizing operations [PDF]
, 1994 Notions from formal language learning theory are characterized in terms of standardizing operations on classes of recursively enumerable languages. Algorithmic identification in the limit of grammars from text presentation of recursively enumerable ...
Sanjay Jain +5 more
core +1 more source
Lattice embeddings in the recursively enumerable truth table degrees [PDF]
, 1987 It is shown that every finite lattice, and in fact every recursively presentable lattice, can be embedded in the r.e. tt \text {tt} -degrees by a map preserving least and greatest elements.
Christine Ann Haught
core +1 more source
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
Nine test tubes generate any RE language [PDF]
, 2000 In this paper we discuss how any recursively enumerable language can be generated using a distributed splicing system with a fixed number of nine test tubes.
Ferretti, C. +5 more
core +1 more source
Advanced Healthcare Materials, EarlyView.This review examines how cellular behavior is regulated by mechanical cues transmitted through soft biomaterials, from single‐cell mechanosensing to tissue‐level adaptation. It highlights why physiological relevance, rather than model complexity alone, is critical for translational mechanobiology and introduces a scoring framework linking material ...
Mathias Polz +9 more
wiley +1 more source
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 +1 more source
Advanced Robotics Research, EarlyView.DRIVE‐SAFE evaluates learning‐based, black‐box autonomous driving policies against evolving temporal safety requirements using Signal Temporal Logic robustness metrics. It aggregates distributional robustness measures with domain‐informed weights to guide iterative retraining.
Kristy Sakano +3 more
wiley +1 more source