Sciweavers

    68
    Voted
    IPL
    2010
    69views more  IPL 2010»
    A simple representation of subwords of the Fibonacci word
    14 years 9 months ago
    A simple representation of subwords of the Fibonacci word
    Download  tcs.uj.edu.pl
    We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...
    Bartosz Walczak
    claim paper
    Read More »
    93
    Voted
    STRINGOLOGY
    2008
    123views Programming Languages» more  STRINGOLOGY 2008»
    Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
    15 years 8 days ago
    Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
    Download  www.mimuw.edu.pl
    The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
    Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.