Results 31 to 40 of about 171,423 (283)
On reversal-bounded picture languages
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changwook Kim, Ivan Hal Sudborough
openaire +1 more source
Parenthèses et ruptures énonciatives en langue des signes française
Discours, 2014 How can parenthesis be defined in Sign Language? When applied to oral speech, the concept of parenthesis refers to a particular type of interpolated phrase, bounded on the left and on the right, and determined by prosodic, syntactic and discursive ...
Annie Risler
doaj +1 more source
Array languages and the challenges of modern computer architecture [PDF]
, 2004 There has always been a close relationship between programming language design and computer design. Electronic computers and programming languages are both 'computers' in Turing's sense.
Blelloch G., Paul Cockshott
core +1 more source
Theor. Comput. Sci., 1987 The authors show that for a given alphabet A and a morphism h the set of words w such that the D0L language L(A,h,w) is bounded (i.e. is a subset of \(x\) \(*_ 1x\) \(*_ 2...x\) \(*_ n\) for some words \(x_ 1,x_ 2,...,x_ n\) over A) is B *, where B is an effectively computable subset of A.
Tom Head, Barbara Lando
openaire +3 more sources
Decision Trees for Binary Subword-Closed Languages
Entropy, 2023 In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision ...
Mikhail Moshkov
doaj +1 more source
Succinctness of two-way probabilistic and quantum finite automata [PDF]
, 2009 We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-way nondeterministic finite automata (2NFA's).
Say, A. C. Cem, Yakaryilmaz, Abuzer
core +6 more sources
Pitfalls of C# Generics and Their Solution Using Concepts
Труды Института системного программирования РАН, 2018 In comparison with Haskell type classes and C++ concepts, such object-oriented languages as C# and Java provide much limited mechanisms of generic programming based on F-bounded polymorphism.
Julia Belyakova, Stanislav Mikhalkovich
doaj +1 more source
Structure and event, networks and nodes in human geography: the 1960s revisited [PDF]
Geographica Helvetica, 2013 In search of transnational scholarship and languages within human geography, the so-called ''Quantitative Revolution'' of the 1960s arguably holds considerable pride of place.
U. Strohmayer
doaj +1 more source
Layers of Borrowings in Karachay-Balkar Cultural Vocabulary
Oriental Studies, 2023 Introduction. The publication of the joint monograph titled ‘Karachays. Balkars’ and edited by M. Karaketov and H.-M. Sabanchiev introduced into scientific circulation a large layer of vocabulary characterizing some specific aspects of Karachay-Balkar ...
Mudrak Oleg A.
doaj +1 more source
On counting functions and slenderness of languages
, 2019 We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$.
Ibarra, Oscar H. +2 more
core +1 more source