Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and formal power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bertrand numeration systems and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and \(p\)-recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational transductions and complexity of counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the base-dependence of sets of numbers recognizable by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of Numeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of numbers and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy numeration systems and regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numeration systems on a regular language / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\beta\)-shift, numeration systems, and automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cobham-Semenov theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of regular languages and recognizability of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of automatic sequences for numeration systems on a regular language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numeration systems, linear recurrences, and regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing regular languages with polynomial densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 23:26, 3 June 2024

scientific article; zbMATH DE number 1715653
Language Label Description Also known as
English
Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
scientific article; zbMATH DE number 1715653

    Statements

    Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (English)
    0 references
    0 references
    3 March 2002
    0 references
    0 references
    Numeration system
    0 references
    Recognizability
    0 references
    Arithmetic operations
    0 references
    Complexity
    0 references
    Rational series
    0 references