ECO-Approximation of Algebraic Functions

Elisa Pergola (), Renzo Pinzani () and Simone Rinaldi ()
Additional contact information
Elisa Pergola: Dipartimento di Sistemi e Informatica
Renzo Pinzani: Dipartimento di Sistemi e Informatica
Simone Rinaldi: Dipartimento di Sistemi e Informatica

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 719-730 from Springer

Abstract: Abstract In this paper we use ECO method to enumerate restricted classes of combinatorial objects; if a succession rule Ω describes the construction of a class, then the restricted class can be described by means of an approximating succession rule Ω k obtained from Ω; we determine finite approximating rules for various classes of paths, and the approximation of the corresponding algebraic language with a regular one.

Keywords: Regular Language; Lattice Path; Combinatorial Object; Succession Rule; Dyck Path (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_71

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_71

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().