Results 51 to 60 of about 40,986 (266)
The Černy Conjecture for aperiodic automata [PDF]
A word w is called a synchronizing (recurrent, reset) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some state; a DFA that has a synchronizing word is said to be synchronizing. Cerny conjectured in 1964 that every n-state synchronizing DFA possesses a synchronizing word of length at most (n -1)2.
arxiv
Digital radiography image quality evaluation using various phantoms and software
Abstract Purpose To investigate the effect of the exposure parameters on image quality (IQ) metrics of phantom images, obtained automatically using software or from visual evaluation. Methods Three commercial phantoms and a homemade phantom constructed according to the instructions given in the IAEA Human Health Series No.
Ioannis A. Tsalafoutas+4 more
wiley +1 more source
The Spider: Anaylsis of an Automaton
[Editors' note: This paper is the 2017 winner of the Student Paper Award in Document(ation) Studies, http://documentacademy.org/award. Susannah Munson wrote the paper as a Kent State University, School of Information, Museum Studies student.] The ...
Susannah Munson
doaj +1 more source
The article explores the process of image recognition. The author analyses everyday language to identify correlattions between cognitive patterns of the image and a set of alternative etymons and cognitive patterns in Russian and other languages — Greek,
Ilyin M. V.
doaj +1 more source
Self-Automaton Semigroups [PDF]
After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special classes of semigroups. We answer a question posed by Cain relating to the dual construction.
arxiv +1 more source
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
Service Function Chaining Based on Grammar in Software Defined Networks [PDF]
Service Function Chaining is an architecture for orchestrating network services that assign choice to the network. This architecture is essentially a policy structure that should form the proper chain of services.
Pouya Khosravian Dehkordi+3 more
doaj +1 more source
Automata Approach to XML Data Indexing
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
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
flexfringe: A Passive Automaton Learning Package
Finite state models, such as Mealy machines or state charts, are often used to express and specify protocol and software behavior. Consequently, these models are often used in verification, testing, and for assistance in the development and maintenance ...
S. Verwer, Christian Hammerschmidt
semanticscholar +1 more source