This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars.

In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for specific games and rely on substantial background knowledge. We introduce a general system for learning board game rules from videos and demonstrate it on several well-known games. The presented algorithm requires only a few...

We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in ...

introduction: knowledge is a critical resource for organizations working in dynamically competitive environments. in any organization, leaders who have the power to incite and influence knowledge management processes. nevertheless, there is lack of empirical evidence from previous studies on examining this relationship. in view of this, the current study examined the relationship between transf...

In this paper we study the properties of systems of bounded arithmetic capturing small complexity classes and state conditions sufficient for such systems to capture the corresponding complexity class tightly. Our class of systems of bounded arithmetic is the class of secondorder systems with comprehension axiom for a syntactically restricted class of formulas Φ ⊂ Σ 1 based on a logic in the de...

Traditionally, texts have been analysed using various information retrieval related methods, such as full-text analysis, and natural language processing. However, only few examples of data mining in text, particularly in full text, are available. In this paper we show that general data mining methods are applicable to text analysis tasks such as descriptive phrase extraction. Moreover, we prese...

In this short report I outline work that makes a case for the abandonment of queries in approaches to information access. I first highlight problems with queries. I then point out the complementary nature of query-based and browse-based approaches. I describe the “Ostensive Model” that forms the core of a new approach combining the two traditional approaches. It replaces the current reliance up...