Algorithms for producing and ordering lexical and nonlexical sequences out of one element
From MaRDI portal
Publication:659617
Abstract: This paper deals with algorithms for producing and ordering lexical and nonlexical sequences of a given degree. The notion of "elementary operations" on positive integral sequences is introduced. Our main theorem answers the question of when two lexical sequences are adjacent.
Recommendations
Cites work
- scientific article; zbMATH DE number 4094453 (Why is no real title available?)
- scientific article; zbMATH DE number 1202312 (Why is no real title available?)
- Adjacency and parity relations of words in discrete dynamical systems
- Classification of all cycles of the parabolic map
- Combinatorics on words in symbolic dynamics: The quadratic map
- MSS sequences, colorings of necklaces, and periodic points of f(z)=z^ 2-2
- Maximal words connected with unimodal maps
- Problems in combinatorics on words originating from discrete dynamical systems
- Relations between words and maps of the interval
Cited in
(4)
This page was built for publication: Algorithms for producing and ordering lexical and nonlexical sequences out of one element
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659617)