Results 11 to 20 of about 5,062,072 (216)
Interpreting language-learning data [PDF]
This book provides a forum for methodological discussions emanating from researchers engaged in studying how individuals acquire an additional language.
Gudmestad, Aarnes; Virginia Polytechnic Institute and State University +18 more
core +17 more sources
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes [PDF]
A recognizable picture language is defined as the projection of a local picture language defined by a set of two-by-two tiles, i.e. by a strictly-locally-testable (SLT) language of order 2.
Restivo, Antonio +2 more
core +3 more sources
Deterministic recognizability of picture languages with Wang automata [PDF]
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online ...
Violetta Lonati, Matteo Pradella
openaire +8 more sources
Accepting Networks of Evolutionary Picture Processors [PDF]
We extend the study of networks of evolutionary processors accepting words to a similar model, processing rectangular pictures. To this aim, we introduce accepting networks of evolutionary picture processors and investigate their computational power.
Mitrana, Victor +6 more
core +1 more source
Recognizability of Tetrahedral Picture Languages
In two dimensions, tiling the plane plays a vital role. Many picture generative models were attempted to tile the three dimensional space. A. Dharani et al. [6] introduced a new theoretical picture generative model to tile a three dimensional space using tetrahedral tile in two different ways namely Sequential Space Filling Grammar (SSFG) and Parallel ...
F. Sweety* +3 more
openaire +1 more source
Operations Preserving Recognizable Languages [PDF]
Given a subset S of N, ltering a word a0a1 an by S consists in deleting the letters a i such that i is not in S. By a natural generalization, denote by L[S], where L is a language, the set of all words of L ltered by S. The ltering problem is to
Boasson, Luc +9 more
core +1 more source
Unambiguous recognizable two-dimensional languages [PDF]
We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family.
Anselmo, M. +14 more
core +1 more source
Operations preserving recognizable languages [PDF]
. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], where L is a language, the set of all words of L filtered by S. The filtering problem
Boasson, Luc +9 more
core +1 more source
ABSTRACT Background Survivors of pediatric brain tumors (PBTs) can experience long‐term social difficulties, impacting quality of life. Beyond medical and environmental factors, family psychosocial risk may play a role in social outcomes by shaping the caregiving environment and may provide intervention options.
Renske H. Houben +4 more
wiley +1 more source
ABSTRACT Background Young adult childhood cancer survivors (YA‐CCS) have an increased risk of treatment‐related health complications throughout their lives. Lifelong survivorship care is recommended, yet many YA‐CCS experience disruptions in care during pediatric‐to‐adult transitions and do not receive recommended survivorship care.
Kevin Shanchen Pu +8 more
wiley +1 more source

