LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS (Q5247167): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054114400164 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104040325 / rank
 
Normal rank

Latest revision as of 11:28, 30 July 2024

scientific article; zbMATH DE number 6429375
Language Label Description Also known as
English
LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
scientific article; zbMATH DE number 6429375

    Statements

    LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS (English)
    0 references
    0 references
    23 April 2015
    0 references
    antidictionary
    0 references
    regular language
    0 references
    finite automaton
    0 references
    combinatorial complexity
    0 references
    growth rate
    0 references
    state graph
    0 references

    Identifiers