A Story About Computing with Roots of Unity

Bergeron, François

doi:10.1007/978-1-4613-9647-5_18

Search citation statements

Order By: Relevance

Paper Sections

Select...

Realization With Maple1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2008

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [Ber89] we get a hint on how to handle this problem: Consider an expression containing several p th roots of unity (let s be a primitive one). Thus our computations take place in the field Q[s] which is isomorphic to Q[x]/ Φ p (x) .…”

Section: Realization With Maplementioning

confidence: 99%

Regular languages and their generating functions: The inverse problem

Koutschan

2008

Theoretical Computer Science

View full text Add to dashboard Cite

The technique of determining a generating function for an unambiguous context-free language is known as the Schützenberger methodology. For regular languages, Elena Barcucci et al. proposed an approach for inverting this methodology. This idea allows a combinatorial interpretation (by means of a regular language) of certain positive integer sequences that are defined by C-finite recurrences. In this paper we present a Maple implementation of this inverse methodology and describe various applications. We give a short introduction to the underlying theory, i.e., the question of deciding N-rationality. In addition, some aspects and problems concerning the implementation are discussed; some examples from combinatorics illustrate its applicability.

show abstract

Section: Realization With Maplementioning

confidence: 99%

Regular languages and their generating functions: The inverse problem

Koutschan

2008

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

A Story About Computing with Roots of Unity

Cited by 1 publication

References 1 publication

Regular languages and their generating functions: The inverse problem

Regular languages and their generating functions: The inverse problem

Contact Info

Product

Resources

About