Results 71 to 80 of about 501 (254)
How powerful is unconditional transfer? -When UT meets AC.- [PDF]
, 1997 We prove that every recursively enumerable language can be generated by a programmed grammar with context-free core rules using unconditional transfer with leftmost derivation of type 3 or type 2.
Fernau, H. (Tuebingen Univ. (Germany). Wilhelm-Schickard-Inst. fuer Informatik) +2 more
core
Researching Attitude–Identity Dynamics to Understand Social Conflict and Change
European Journal of Social Psychology, EarlyView.Abstract Societies undergo constant change, manifested in various ways such as technological developments, economic transitions, reorganization of cultural values and beliefs, or changes in social structures. Individuals play an active role in shaping social and societal change by interactively negotiating its manifestation.
Adrian Lüders +4 more
wiley +1 more source
The power of commuting with finite sets of words [PDF]
, 2005 We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1971 and also strongly disproves Conway’s conjecture on context-freeness of ...
Michal Kunc
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
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 +9 more
wiley +1 more source
Modern perspectives in Proof Theory. [PDF]
Philos Trans A Math Phys Eng Sci, 2023 Aguilera JP, Pakhomov F, Weiermann A.
europepmc +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
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 +3 more
wiley +1 more source
An Interdisciplinary Review of the Gaslighting Literature and Future Research Agenda
Journal of Organizational Behavior, EarlyView.ABSTRACT Gaslighting is increasingly discussed in organizational contexts, yet its meaning, boundaries, and process remain unclear within management and organizational scholarship. Although research on gaslighting has expanded across multiple disciplines, existing work is conceptually fragmented and difficult to integrate, limiting cumulative theory ...
Paula A. Kincaid, Samantha C. O. Stalion
wiley +1 more source
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality [PDF]
, 2011 This paper concerns new characterizations of regular, context-free, and recursively enumerable languages, using insertion systems with lower complexity. This is achieved by using both strictly locally testable languages and morphisms.
Fujioka, Kaoru, Kaoru Fujioka
core +1 more source