Nelma Moreira

Enumeration and generation with a string automata representation

In general, the representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we show how a (unique) string representation for (complete) initially-connected deterministic automata (ICDFAs) with n states over an alphabet of k symbols can be used for counting, exact enumeration, sampling and optimal coding, not only the set of ICDFAs but, to some extent, the set of regular languages. An exact generation algorithm can be used to partition the set of ICDFAs in order to parallelize the counting of minimal automata (and thus of regular languages). We present also a uniform random generator for ICDFAs that uses a table of pre-calculated values. Based on the same table it is also possible to obtain an optimal coding for ICDFAs.

Towards an Architecture for Emotional BDI Agents

In this paper we present the emotional-BDI architecture, an extension to the BDI architecture supporting artificial emotions and including internal representations for agents capabilities and resources. The architecture we present here is conceptual, defining which components should exist so that emotional-BDI agents can use effective capabilities as well as effective resources in order to better cope with highly dynamic environments

Formal Modelling of Emotions in BDI Agents

Emotional-BDI agents are BDI agents whose behaviour is guided not only by beliefs, desires and intentions, but also by the role of emotions in reasoning and decision-making. The

ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA

\mathcal{E}_{\rm BDI}

ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED

logic is a formal system for expressing the concepts of the Emotional-BDI model of agency. In this paper we present an improved version of the

Symmetric Groups and Quotient Complexity of Boolean Operations

\mathcal{E}_{\rm BDI}

Partial derivative automata formalized in Coq

logic and show how it can be used to model the role of three emotions in Emotional-BDI agents: fear , anxiety and self-confidence . We also focus in the computational properties of

Interactive manipulation of regular objects with FAdo

\mathcal{E}_{\rm BDI}

Series-Parallel Automata and Short Regular Expressions

which can lead to its use in automated proof systems.

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics

In this paper, the relation between the Glushkov automaton and the partial derivative automaton of a given regular expression, in terms of transition complexity, is studied. The average transition complexity of was proved by Nicaud to be linear in the size of the corresponding expression. This result was obtained using an upper bound of the number of transitions of . Here we present a new quadratic construction of that leads to a more elegant and straightforward implementation, and that allows the exact counting of the number of transitions. Based on that, a better estimation of the average size is presented. Asymptotically, and as the alphabet size grows, the number of transitions per state is on average 2. Broda et al. computed an upper bound for the ratio of the number of states of to the number of states of which is about ½ for large alphabet sizes. Here we show how to obtain an upper bound for the number of transitions in , which we then use to get an average case approximation. In conclusion, assymptotically, and for large alphabets, the size of is half the size of the . This is corroborated by some experiments, even for small alphabets and small regular expressions.