On permutations generated by infinite binary words.

Makarov, M.A.

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] (2006)

  • Volume: 3, page 304-311
  • ISSN: 1813-3304

How to cite

top

Makarov, M.A.. "On permutations generated by infinite binary words.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 3 (2006): 304-311. <http://eudml.org/doc/54783>.

@article{Makarov2006,
author = {Makarov, M.A.},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {finite automata; infinite permutation; suffix tree},
language = {eng},
pages = {304-311},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {On permutations generated by infinite binary words.},
url = {http://eudml.org/doc/54783},
volume = {3},
year = {2006},
}

TY - JOUR
AU - Makarov, M.A.
TI - On permutations generated by infinite binary words.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2006
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 3
SP - 304
EP - 311
LA - eng
KW - finite automata; infinite permutation; suffix tree
UR - http://eudml.org/doc/54783
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.