Results 11 to 20 of about 9,778 (268)
Tree Automata and Automata on Linear Orderings [PDF]
RAIRO - Theoretical Informatics and Applications, 2009 Summary: We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second-order theory of the infinite binary tree.
Bruyère, Véronique +2 more
openaire +2 more sources
Моделирование и анализ информационных систем, 2015 Push-down automata with independent counters (PDACs) combine the power of PDAs and Petri Nets. They were developed in [21, 15], as a tool of recognition of languages generated by Categorial Dependency Grammars (CDGs).
Michael Dekhtyar, Boris Karlov
doaj +1 more source
CONTRIBUTIONS OF MUSLIM MECHANICAL ENGINEERS IN MODERN AUTOMATA (IN THE LIGHT OF KITĀB AL-ḤIYAL OF AL- ǦAZARĪ) A DESCRIPTIVE AND ANALYTICAL STUDY [PDF]
Journal of the General Union of Arab Archaeologists, 2021 (Ar) اسهامات الهندسة الميكانيكية الإسلامية في تطوير الآلات ذاتية الحركة (في ضوء كتاب الحيل للجزري) دراسة وصفية تحليلية هل كان للعرب المسلمين قديما باع في علم الهندسة الميكانيكية؟ وهل كان لهم السبق على الغرب في هذا المجال؟ من الملاحظ حاليا أن العرب ...
Boussy Zidan
doaj +1 more source
A Universal Framework for Analysis of Self-Replication Phenomena
Entropy, 2009 In this paper, we propose definitions for a general, domain-independent concept of replicability and specifically focus on the notion of self-replication.
Hod Lipson, Bryant Adams
doaj +1 more source
Local Normal Forms for First-Order Logic with Applications to Games and Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x_1,...,x_l, \forall y, φ where φ is r-local around y, i.e. quantification in φ is restricted to elements of the universe of
Thomas Schwentick, Klaus Barthelmann
doaj +1 more source
Automata and automata mappings of semigroups
CoRR, 2015 6 ...
Boris I. Plotkin, Tatjana L. Plotkin
openaire +2 more sources
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers
Algorithms, 2018 The concept of edit distance and its variants has applications in many areas such as computational linguistics, bioinformatics, and synchronization error detection in data communications.
Lila Kari +3 more
doaj +1 more source
Children's engagement and learning in "moving toys" workshops in the 1st cycle of schooling
INFAD, 2020 The motivation and interest of children and young people in science areas remains a challenge for contemporary education, and there is also evidence of the importance of its promotion since the early years of schooling as well as the use of ...
A. Santos +15 more
doaj +1 more source
Recognizability for Automata [PDF]
, 2018 We present a new approach to define boolean algebras of various language families: given a family \(\mathcal {F}\) of infinite automata, an automaton H recognizes the set of languages accepted by all automata of \(\mathcal {F}\) that can be mapped by morphism into H.
Caucal, Didier, Rispal, Chloé
openaire +2 more sources