Results 21 to 30 of about 550 (233)
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components.
Erzsébet Csuhaj-Varjú, György Vaszil
doaj +1 more source
Transformation of Turing Machines into Context-Dependent Fusion Grammars [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Context-dependent fusion grammars were recently introduced as devices for the generation of hypergraph languages. In this paper, we show that this new type of hypergraph grammars, where the application of fusion rules is restricted by positive and ...
Aaron Lye
doaj +1 more source
Turing machines based on unsharp quantum logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs ...
Yun Shang, Xian Lu, Ruqian Lu
doaj +1 more source
Dyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languages [PDF]
Dyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languagesapplication/pdf In this paper, we give a direct proof of the result of Latteux and Turakainen that the full class of recursively enumerable languages can be obtained from minimal linear languages (which are generated by linear context-free grammars with only one nonterminal symbol) by Dyck reductions (which reduce pairs of parentheses to the empty word)
Hirose, Sadaki, Okawa, Satoshi
openaire +2 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
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
On homomorphic images of rational stochastic languages [PDF]
, 1976 It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a language belonging to a proper subfamily of all rational stochastic languages.
Turakainen, Paavo
core +1 more source
On languages generated by asynchronous spiking neural P systems [PDF]
, 2009 In this paper, we investigate the languages generated by asynchronous spiking neural P systems. Characterizations of finite languages and recursively enumerable languages are obtained by asynchronous spiking neural P systems with extended rules.
Zhang, Xingyi +2 more
core +1 more source
Representation theorems using DOS languages [PDF]
, 1982 It is demonstrated that every context-free language is a homomorphic image of the intersection of two DOS languages and that every recursively enumerable language is the homomorphic image of the intersection of three DOS languages. It is also proved that
G. Rozenberg +3 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