Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Generating a Gray code for P-sequences

From MaRDI portal
Publication:1868262
Jump to:navigation, search

DOI10.1023/A:1015622720041zbMath1064.68080MaRDI QIDQ1868262

Vicentiu Vajnovszki

Publication date: 27 April 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)


zbMATH Keywords

loopless generating algorithmsparentheses stringsGray codesP-sequences


Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Prefix, length-variable, comma-free codes (94A45)


Related Items (3)

A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ Gray coding cubic planar maps ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously







This page was built for publication: Generating a Gray code for P-sequences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1868262&oldid=14257656"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 11:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki