We show how to adopt existing non-DFS-based algorithm OWCTY [ČP03] for accepting cycle detection to the I/O efficient setting and compare the I/O efficiency and practical performance of the adopted algorithm to the existing I/O efficient LTL model checking approach of Edelkamp et al. [EJ06]. We show that while the new algorithm exhibits similar I/O complexity with respect to the size of the gra...

A concept of accepting colonies is introduced. A hybrid connectionist-symbolic architecture (\neural pushdown automaton") for inference of colonies based on presentation of positive and negative examples of strings is then described, together with an algorithm for extracting a colony from trained neural network. Some examples of the inference of colonies gener-ating/accepting simple context-fre...

Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m ≥ 2 for a wide class of linear numeration systems. As an example, the number of states of the trim minimal automaton accepting the greedy representations of mN in the Fibonacci system is exactly 2m.

The intractability of the complexity class NP has motivated the study of subclasses that arise when certain restrictions on the definition of NP are imposed. For example, the study of sparse sets in NP [Ma82], the study of the probabilistic classes whithin NP [Gi77], and the study of low sets in NP for the classes in the polynomial time hierarchy [Sc83], have been three main research streams in...

BACKGROUND THE OBJECTIVES ARE TO DETERMINE IF: 1) accepting disability as a part of aging is associated with frailty; and 2) accepting disability is associated with becoming frail over a five-year period. METHODS Secondary analysis of a prospective cohort study of 1,751 community-dwelling adults aged 65+. Participants were asked to rate their agreement with the statement: "When you reach my a...

In this thesis, we consider minimality and size reduction issues of one-tape and multitape automata. Although the topic of minimization of one-tape automata has been widely studied for many years, it seems that some issues have not gained attention. One of these issues concerns finding specific conditions on automata that imply their minimality in the class of nondeterministic finite automata (...

the software license agreements form. nowadays. a large portion of international transactions. meanwhile. the escrow agreements are usually as an important part of these contracts without which they could not be entered into. the escrow agreement is a three dimensions contract and formed by three parties jointly. which side is the offering or accepting party and whether could two parties jointl...