Algorithms for producing and ordering lexical and nonlexical sequences out of one element
From MaRDI portal
Publication:659617
DOI10.1007/S00026-011-0079-4zbMATH Open1233.68182arXiv0810.5205OpenAlexW1967991993MaRDI QIDQ659617FDOQ659617
Authors: Elias Abboud
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0810.5205
Recommendations
Cites Work
- Title not available (Why is that?)
- 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
- Adjacency and parity relations of words in discrete dynamical systems
- Relations between words and maps of the interval
- Combinatorics on words in symbolic dynamics: The quadratic map
- Title not available (Why is that?)
- Classification of all cycles of the parabolic map
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)