We study a game for recognising formal languages, in which two players with imperfect information need to coordinate on a common decision, given private input words correlated by a finite graph. The players have a joint objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input. We show that the acceptor model based on consensus games characterises context-sen...

We present an approach specifying constraints on labeled trees, such as are commonly used within (computational) linguistic theories, and show how to translate these constraints to formal grammars, in particular context-free grammars and (lexicalized) tree adjoining grammars. Our method offers the formal advantages of constraint-based formalisms and at the same time operational efficiency for t...

A context-free grammar and its derivations can be described by a Petri net, called a context-free Petri net, whose places and transitions correspond to the nonterminals and the production rules of the grammar, respectively, and tokens are separate instances of the nonterminals in a sentential form. Therefore, the control of the derivations in a context-free grammar can be implemented by adding ...

This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text, named Constraint-based Synchronous Grammar (CSG). Unlike other synchronous grammars, CSG allows multiple target productions to be associated to a single source production rule, which can be used to guide a parser to...

This opinion piece seeks to define and contextualise educational terms that are used, appear be misused, in contemporary academic literature practice. It aims explore the concept these three words, open, flexible, distance, fall into categories of policy, mode learning, models delivery. In context which globaleducational community across all sectors adapts new forms it is essential practitioner...

Resources and services are accessible in pervasive computing environments from anywhere and at any time. Also, due to ever-changing nature of such environments, the identity of users is unknown. However, users must be able to access the required resources based on their contexts. These and other similar complexities necessitate dynamic and context-aware access control models for such environmen...

Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this paper, we use Formal Concept Analysis (FCA) to characterize a set of AJDs that hold in a given dataset. This present work simplifies and generalizes the characterization of Multivalued Dependencies with FCA.