Skip to main content

Efficient Generation of Gray Codes for Reflectable Languages

  • Conference paper
Computational Science and Its Applications – ICCSA 2010 (ICCSA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6019))

Included in the following conference series:

  • 886 Accesses

Abstract

Y. Li and J. Sawada classified a type of language called a reflectable language [Inform. Process. Lett. 109 (2009) 296-300], and gave a generic recursive algorithm GrayCode to list all strings of length n for any reflectable language in Gray code order. GrayCode runs in O(n) worst-case time per string for any application. Based on Williamson’s algorithm for k-ary strings, a generic non-recursive algorithm GenericNext is proposed in this paper to list all strings of length for any reflectable language in Gray code order, but the worst-case time is O(1) per string for all the applications mentioned in Y. Li and J. Sawada’s paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Li, Y., Sawada, J.: Gray codes for reflectable languages. Information Processing Letters 109, 296–300 (2009)

    Article  MathSciNet  Google Scholar 

  2. Williamson, S.G.: Combinatorics for Computer Science. Computer Science Press, Rockville (1985)

    Google Scholar 

  3. Xiang, L., Cheng, K., Ushijima, K.: On Gray Code for Set Partitions. In: Proc. Information -MFCSIT 2006, Cork, Ireland, August 1-5, pp. 180–183 (2006)

    Google Scholar 

  4. Xiang, L., Ushijima, K.: On O(1) Time Algorithms for Combinatorial Generation. The Computer Journal 44(4), 292–302 (2001)

    Article  MATH  Google Scholar 

  5. Xiang, L., Ushijima, K., Akl, S.G.: Generating regular k-ary trees efficiently. The Computer Journal 43(4), 290–300 (2000)

    Article  MATH  Google Scholar 

  6. Xiang, L., Ushijima, K., Tang, C.: Efficient loopless generation of Gray codes for k- ary trees. Information Processing Letters 76, 169–174 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Xiang, L., Ushijima, K., Tang, C.: Grammar-oriented enumeration of binary trees. The Computer Journal 40(5), 278–291 (1997)

    Article  MATH  Google Scholar 

  8. Zaks, S.: Lexicographic generation of ordered trees. Theoret. Comp. Sci. 10, 63–82 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiang, L., Cheng, K., Ushijima, K. (2010). Efficient Generation of Gray Codes for Reflectable Languages. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds) Computational Science and Its Applications – ICCSA 2010. ICCSA 2010. Lecture Notes in Computer Science, vol 6019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12189-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12189-0_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12188-3

  • Online ISBN: 978-3-642-12189-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics