Results 41 to 50 of about 171,423 (283)

Bounded prefix-suffix duplication [PDF]

open access: yes, 2014
We consider a restricted variant of the prefix-suffix duplication operation, called bounded prefix-suffix duplication. It consists in the iterative duplication of a prefix or suffix, whose length is bounded by a constant, of a given word.
A. Ehrenfeucht   +9 more
core   +1 more source

Multilingualism, Multi-competence and (Limits to) the Interaction Between Language Systems

open access: yesTeanga: The Journal of the Irish Association for Applied Linguistics, 2018
This article addresses the proposition that all talk whatsoever of bounds between language-varieties in the mind should be abandoned. This abandonment of boundaries is a standard view in respect of the semantic or conceptual dimensions of language.
David Singleton
doaj   +1 more source

The relationship between verbal form and event structure in sign languages

open access: yesGlossa, 2019
Whether predicates describe events as inherently bounded (telic) or unbounded (atelic) is usually understood to be an emergent property that depends on several factors; few, if any, spoken languages have dedicated morphology to mark the distinction.
Andrea D. Sims   +3 more
doaj   +2 more sources

Uncountable realtime probabilistic classes

open access: yes, 2017
We investigate the minimum cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages.
Dimitrijevs, Maksims   +1 more
core   +3 more sources

Aperiodic String Transducers

open access: yes, 2016
Regular string-to-string functions enjoy a nice triple characterization through deterministic two-way transducers (2DFT), streaming string transducers (SST) and MSO definable functions. This result has recently been lifted to FO definable functions, with
E Filiot   +6 more
core   +3 more sources

Ogden's lemma for nonterminal bounded languages [PDF]

open access: yesRAIRO - Theoretical Informatics and Applications, 1986
Summary: The authors present an Ogden-type pumping lemma for nonterminal bounded languages. It is shown that these Ogden-type conditions are stronger than the classical-type pumping conditions for nonterminal bounded languages. However, it is shown that they are not sufficient.
R. Boonyavatana, Giora Slutzki
openaire   +1 more source

Diachronic development of the Nuclear Austronesian locative and patient applicatives

open access: yesNusa, 2023
This paper proposes reconstructions and diachronic developments of the primary patient and locative voice (PV and LV, respectively) suffixes found in the Formosan and Philippine languages.
Edith Aldridge
doaj   +1 more source

Substitution and bounded languages

open access: yesJournal of Computer and System Sciences, 1972
A full AFL is defined to be full-bounded if it can be generated by a set of boundedlanguages. It is shown that if ℳ is an AFL not consisting entirely of regular sets and if ℳ is contained in any full-bounded AFL, then ℳ is not closed under e-free substitution.
openaire   +1 more source

Hypergraph languages of bounded degree

open access: yesJournal of Computer and System Sciences, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joost Engelfriet, Linda Heyker
openaire   +1 more source

‘They Need to Hear You Say It’: Healthcare Professionals’ Perspectives on Barriers and Enablers to End‐of‐Life Discussions With Adolescents and Young Adults With Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT End‐of‐life conversations with adolescents and young adults (AYAs) with cancer rarely occur without the guidance of healthcare professionals. As a part of the ‘Difficult Discussions’ study, focused on palliative care and advance care planning discussions with AYAs with cancer, we investigated the factors that healthcare professionals identify ...
Justine Lee   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy