Results 21 to 30 of about 171,423 (283)
Journal of Computer and System Sciences, 1968 AbstractA derivation in a phrase-structure grammar is said to be k-bounded if each word in the derivation contains at most k occurrences of nonterminals. A set L is said to be derivation bounded if there exists a phrase-structure grammar G and a positive integer k such that L is the set of words in the language generated by G which have some k-bounded ...
Seymour Ginsburg, Edwin H. Spanier
openaire +1 more source
On bounded languages and reversal-bounded automata
Information and Computation, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar H. Ibarra, Bala Ravikumar
openaire +2 more sources
Englisch als Interferenzquelle bei der Aneignung der Wortstellung des Deutschen
Glottodidactica, 2010 The paper deals with the issue of the interaction of languages in a multilingual person. First, it is related to an error analysis of the word order in German which investigates the influence of English as the first foreign language with the bounded word
Jolanta Hinc
doaj +1 more source
Mobile Apps Development: Towards Incorporating Regional and National languages in Flutter App
Sukkur IBA Journal of Emerging Technologies, 2023 As technology is spreading very fast across the world, people from different countries have started using portable devices like phones, tablets, or laptops. People belonging to different countries and cultures are using smartphones.
Kamran Khan Rajput +5 more
doaj +1 more source
Parikh-bounded languages [PDF]
, 1981 A string y is in C(x), the commutative image of a string x, if y is a permutation of the symbols in x. A language L is Parikh-bounded if L contains a bounded language B and all x in L have a corresponding y in B such that x is in C(y). The central result in this paper is that if L is context-free it is also Parikh-bounded. Parikh's theorem follows as a
Meera Blattner, Michel Latteux
openaire +1 more source
On the Languages Accepted by Watson-Crick Finite Automata with Delays
Mathematics, 2021 In this work, we analyze the computational power of Watson-Crick finite automata (WKFA) if some restrictions over the transition function in the model are imposed.
José M. Sempere
doaj +1 more source
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words [PDF]
Logical Methods in Computer Science, 2009 It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied.
Philipp Weis, Neil Immerman
doaj +1 more source
Restrictions on Multicounter and Partially-Blind Multicounter Languages [PDF]
Computer Science Journal of MoldovaWe introduce a new way of defining languages accepted by multicounter machines. Given a multicounter machine $M$ and $m \ge 0$, the $m$-crossing language accepted by $M$ is the set of all words where there is an accepting computation of $M$ on $w$ such ...
Oscar H. Ibarra, Ian McQuillan
doaj +1 more source
Complete Symmetry in D2L Systems and Cellular Automata [PDF]
, 1985 We introduce completely symmetric D2L systems and cellular automata by means of an additional restriction on the corresponding symmetric devices. Then we show that completely symmetric D2L systems and cellular automata are still able to simulate Turing ...
Asveld, Peter R.J.
core +5 more sources
On sets of numbers rationally represented in a rational base number system [PDF]
, 2013 In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid.
J.M. Autebert, S. Akiyama, S.A. Greibach
core +2 more sources