Some Combinatorial Properties of Factorial Languages

Aldo de Luca and Stefano Varricchio
Additional contact information
Aldo de Luca: Università di Roma “La Sapienza”, Dipartimento di Matematica
Stefano Varricchio: Università di Roma “La Sapienza”, Dipartimento di Matematica

A chapter in Sequences, 1990, pp 258-266 from Springer

Abstract: Abstract A language L over a finite alphabet A is factorial if each factor (or subword) of any word of L still belongs to L. Typical examples of factorial languages are those formed by all finite factors of a given set of infinite words. In this case the language satisfies the important property that any word of L can be prolonged, in at least one direction, in the language.

Keywords: Finite Alphabet; Information Processing Letter; Burnside Problem; Infinite Word; Factorial Language (search for similar items in EconPapers)
Date: 1990
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-1-4612-3352-7_20

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

DOI: 10.1007/978-1-4612-3352-7_20

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 ().