Results 71 to 80 of about 550 (233)

Logics and admissible rules of constructive set theories. [PDF]

Philos Trans A Math Phys Eng Sci, 2023
Iemhoff R, Passmann R.
europepmc   +1 more source

DNA computing based on splicing: universality results [PDF]

, 2000
First, we recall some characterizations of recursively enumerable languages by means of finite H systems with certain regulations on the splicing operation.
Păun, Gheorghe
core   +1 more source

A New Implementation of Network GARCH Model for Stock Volatility and Co‐Volatility Forecasting

Journal of Forecasting, EarlyView.
ABSTRACT Volatility clustering and spillovers are key features of financial time series with many cross‐sectional assets. While network analysis links similar or correlated stocks and helps trace volatility spillovers, contemporary multivariate ARCH‐GARCH formulations struggle to represent structured network dependence and remain parsimonious.
Peiyi Zhou
wiley   +1 more source

P systems with minimal insertion and deletion [PDF]

, 2011
In this paper, we consider insertion–deletion P systems with priority of deletion over insertion. We show that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages
Alhazov, Artiom, Verlan, Sergey, Krassovitskiy, Alexander, Rogozhin, Yurii, Sergey Verlan, Yurii Rogozhin, Artiom Alhazov, Alexander Krassovitskiy   +7 more
core   +1 more source

Language interventions for autistic people: An online survey of community member views and priorities

JCPP Advances, EarlyView.
Abstract Background Identifying interventions for developing language skills in autistic people is a top research priority. To develop effective language interventions, it is essential to understand whether community members feel they are important, acceptable, and meaningful.
Audrey Linden, Courtenay Norbury, Molly McCabe, Jo Saul, Estelle Killick, Evelyn Sam, Simone Dufresne, Freya Elise, Kurinchi Gurusamy, Laura Crane   +9 more
wiley   +1 more source

The Strong Nash‐Williams Orientation Theorem for Rayless Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley   +1 more source

Expressive completeness of existential rule languages for ontology-based query answering [PDF]

, 2016
Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering.
Zhang, Yan (R8899), You, Jiahuai, Zhang, Heng   +2 more
core  

Context-free insertion–deletion systems [PDF]

, 2005
We consider a class of insertion–deletion systems which have not been investigated so far, those without any context controlling the insertion–deletion operations.
Verlan, Sergey, Margenstern, Maurice, Păun, Gheorghe, Rogozhin, Yurii   +3 more
core   +1 more source

A Framework for Subgroup Dynamics Through the System Dynamics Lens: An Integrative Review of the Attribute and the Network Views

Journal of Organizational Behavior, EarlyView.
ABSTRACT Subgroups are dynamic entities evolving constantly in response to changing contexts and time. Although scholars from both the attribute and the network views have acknowledged that subgroups are inherently complex and fluid, research in these traditions has remained bifurcated, with limited efforts to integrate the two perspectives to more ...
Jinhee Moon, Chunghyun Oh, Chou‐Yu Tsai, Semin Park   +3 more
wiley   +1 more source

CLOSURE PROPERTIES OF LINEAR LANGUAGES UNDER OPERATIONS OF LINEAR DELETION [PDF]

, 2008
In this paper, we give constructive prove that linear languages are closed under operations of regular deletion, and that they are not closed under operations of linear deletion.
Tomáš Masopust, Doctoral Degree Programme, Er Meduna   +2 more
core