Results 231 to 240 of about 638,308 (266)
Some of the next articles are maybe not open access.
Finite-state \(\omega\)-languages
J. Comput. Syst. Sci., 1983This is an important paper about the basics of sets of infinite sequences of words, customarily referred to as \(\omega\)-languages. In particular, the paper is a contribution to the theory of finite-state \(\omega\)-languages introduced by \textit{B. A. Trakhtenbrot} [Sib. Math. Zh. 3, 103--131 (1962; Zbl 0115.00701)]. The paper under review discusses
openaire +1 more source
State complexity of SBTA languages
1995It has already been established that Systolic Binary Tree Automata (SBTA in short) provide an interesting and robust model for one-way computation on binary-tree networks of memory-less processors and that the corresponding family of languages has nice properties reminding those of regular languages and is their proper superfamily.
Jozef Gruska +3 more
openaire +1 more source
Current state of language technologies in Sorbian languages
This poster gives an overview of all publicly available Upper and Lower Sorbian language technology resources, shown from the perspective of an end user. In order to preserve areas where Sorbian can be spoken to a mixed German and Sorbian audience, creating a simultaneous translation from Sorbian to German is one of our core tasks.Sobe, Daniel, Kraljevski, Ivan
openaire +1 more source
State Complexity of Linear Conjunctive Languages
J. Autom. Lang. Comb., 2004Journal of Automata, Languages and Combinatorics, Volume 9, Numbers 2-3, 2004, 365 ...
openaire +2 more sources
Resting State Functional MR Imaging of Language Function
Neuroimaging Clinics of North America, 2021John J Lee +2 more
exaly
A three-state language competition model including language learning and attrition
Frontiers in Complex Systems, 2023Stefano Scialla +2 more
exaly