Results 211 to 220 of about 501 (254)

Revisiting the Health Spending‐Growth Nexus

Journal of Economic Surveys, EarlyView.
ABSTRACT The relationship between health spending and economic growth is shaped by multiple transmission channels, leading to inconsistencies in the empirical literature and a lack of definitive conclusions. To address this issue, we perform a meta‐analysis encompassing 522 estimates from 107 studies that examine the effect of health spending on ...
Andreas Sintos, Michael Chletsos, Eleni Xydea   +2 more
wiley   +1 more source

Beyond the Sober State: The Work of Drunkenness in British Bureaucracy

Sociology Lens, EarlyView.
ABSTRACT This article reports the drinking stories of British civil service clerical workers based at a large civil service office complex located in Newcastle upon Tyne between 1968 and 1993. It uses these stories to develop an account of state formation that takes seriously the place of joy, solidarity, contention, and exhaustion within public sector
Michael Vine
wiley   +1 more source

War as a Phenomenon of Inquiry in Management Studies

Journal of Management Studies, EarlyView.
Abstract We argue that war as a phenomenon deserves more focused attention in management. First, we highlight why war is an important and relevant area of inquiry for management scholars. We then integrate scattered conversations on war in management studies into a framework structured around three building blocks – (a) the nature of war from an ...
Fabrice Lumineau, Arne Keller
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fuzzy grammars and recursively enumerable fuzzy languages

Information Sciences, 1992
A fuzzy language ( \(L\)-language) is treated as an \(L\)-subset of \(A^*\) with \(A^*\) being a free monoid of an alphabet defined over a finite set \(A\). The main result of the paper states that if \(L\) is finite then an \(L\)-language is generated by an \(L\)-grammar if and only if it is a recursively enumerable \(L\)-subset.
Giangiacomo Gerla
exaly   +3 more sources

Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages

International Journal of Computer Mathematics, 1997
The family of recursively enumerable languages is characterized by scattered context grammars with four nonterminals. Moreover, this family is characterized by scattered context grammars with three nonterminals if these grammars start their derivations from a word rather than a symbol.
Alexander Meduna
exaly   +2 more sources

Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages

International Journal of Computer Mathematics, 1997
The present paper investigates the descriptional complexity of multi-sequential grammars with respect to the number of nonterminals. This investigation demonstrates that the family of recursively enumerable languages is characterized by six-nonterminal multi-sequential grammars.
Alexander Meduna
exaly   +2 more sources

Scattered context grammars generate any recursively enumerable language with two nonterminals

Information Processing Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
György Vaszil
exaly   +2 more sources

PC grammar systems with five context-free components generate all recursively enumerable languages [PDF]

Theoretical Computer Science, 2003
Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other ...
György Vaszil
exaly   +2 more sources

On characterizations of recursively enumerable languages

Acta Informatica, 1990
\textit{V. Geffert} [Theor. Comput. Sci. 62, 235-249 (1988; Zbl 0664.68075)] has shown that each recursively enumerable language L over \(\Sigma\) can be expressed in the form \(L=\{h(x)^{-1}g(x)|\) x in \(\Delta^+\}\cap \Sigma^*\) where \(\Delta\) is an alphabet and g, h is a pair of morphisms.
Michel Latteux, Paavo Turakainen
openaire   +2 more sources