On definability of one-symbol languages in the monoid of finite languages with concatenation
    
    
  
  
  
      
      
      
        
Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 4 (2020), pp. 5-13
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			We consider an algebra of all finite languages with the concatenation operation. For one-symbol languages it is known that its theory is equivalent to the first-order arithmetic. Earlier it was proved that for regular languages a one-symbol algebra can be interpreted in multi-symbol algebras. Here we show how to define a one-symbol subalgebra in multi-symbol algebras for finite languages.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
language, finite language, concatenation, first-order arithmetic.
                    
                  
                
                
                @article{VTPMK_2020_4_a0,
     author = {S. M. Dudakov},
     title = {On definability of one-symbol languages in the monoid of finite languages with concatenation},
     journal = {Vestnik Tverskogo gosudarstvennogo universiteta. Seri\^a Prikladna\^a matematika},
     pages = {5--13},
     publisher = {mathdoc},
     number = {4},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VTPMK_2020_4_a0/}
}
                      
                      
                    TY - JOUR AU - S. M. Dudakov TI - On definability of one-symbol languages in the monoid of finite languages with concatenation JO - Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika PY - 2020 SP - 5 EP - 13 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VTPMK_2020_4_a0/ LA - ru ID - VTPMK_2020_4_a0 ER -
%0 Journal Article %A S. M. Dudakov %T On definability of one-symbol languages in the monoid of finite languages with concatenation %J Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika %D 2020 %P 5-13 %N 4 %I mathdoc %U http://geodesic.mathdoc.fr/item/VTPMK_2020_4_a0/ %G ru %F VTPMK_2020_4_a0
S. M. Dudakov. On definability of one-symbol languages in the monoid of finite languages with concatenation. Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 4 (2020), pp. 5-13. http://geodesic.mathdoc.fr/item/VTPMK_2020_4_a0/
