#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2009

2013

- This year (0)
- Last five years (1)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Edoardo Carta-Gerardino, Parisa Babaali
- ArXiv
- 2010

Let P(Σ *) be the semiring of languages, and consider its subset P(Σ). In this paper we define the language recognized by a weighted automaton over P(Σ) and a one-letter alphabet. Similarly, we introduce the notion of language recognition by linear recurrence equations with coefficients in P(Σ). As we will see, these two definitions coincide. We prove that… (More)

- Edoardo Carta-Gerardino
- CSC
- 2009

A nonhomogeneous system of linear recurrence equations can be recognized by an automaton A over a one-letter alphabet A = {z}. Conversely, the automaton A generates precisely this nonhomogeneous system of linear recurrence equations. We present the solutions of these systems and apply the z-transform to these solutions to obtain their series representation.… (More)

- Parisa Babaali, Edoardo Carta-Gerardino, Christopher Knaplund
- The Journal of Supercomputing
- 2013

In the last few decades, several techniques to randomly generate a deterministic finite automaton have been developed. These techniques have implications in the enumeration and random generation of automata of size n. One of the ways to generate a finite automaton is to generate a random tree and to complete it to a deterministic finite automaton, assuming… (More)

- ‹
- 1
- ›