Results 41 to 50 of about 12,303 (297)
K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton P due to Glushkov, the c-continuation automaton C due to Champarnaud and Ziadi, the follow ...
Ludovic Mignot +2 more
doaj +1 more source
, 2007 12 pages, 2 figures, 2 tables, CIAA 2007, http://hal.inria.fr/inria-00170414/en/
Kucherov, Gregory +2 more
openaire +3 more sources
Sensors, 2018 Following hospital discharge, millions of patients continue to recover outside formal healthcare organizations (HCOs) in designated transitional care periods (TCPs).
Faisal Alkhaldi, Ali Alouani
doaj +1 more source
Big Data and Cognitive Computing, 2021 Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate the means of working with knowledge representations (as ...
Mark Burgin, Rao Mikkilineni
doaj +1 more source
Automata Approach to XML Data Indexing
Information, 2018 The internal structure of XML documents can be viewed as a tree. Trees are among the fundamental and well-studied data structures in computer science. They express a hierarchical structure and are widely used in many applications.
Eliška Šestáková, Jan Janoušek
doaj +1 more source
Anglica. An International Journal of English Studies, 2021 The present study focuses on the poetics of failed festivity in William Shakespeare’s Titus Andronicus, tracing analogies between early modern festival culture, in particular the Joyous Entry of the Renaissance prince into the city, and the machinery of ...
Agnieszka Żukowska
doaj +1 more source
Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees
Современные информационные технологии и IT-образование, 2021 In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj +1 more source
System management technology for technical maintenance of transport and technological machines [PDF]
E3S Web of Conferences, 2021 The paper considers the generalized structure of maintenance system, including, in the general case, the protection subsystem, the functional diagnostics subsystem, the test diagnostics subsystem, the maintenance and repair subsystem.
Voronin Vladimir
doaj +1 more source
A New Algorithm of Shape Boundaries Based on Chain Coding
ITM Web of Conferences, 2017 A new method to obtain connected component in binary images is presented. The method uses DFA automaton to obtain chain code and label the component boundary.
Zhao Xin, Zheng Jun, Liu Yan
doaj +1 more source