Improved limitedness theorems on finite automata with distance functions (Q908702): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision procedure for the order of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitedness theorem on finite automata with distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation theorems on regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages of star height one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026367 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(90)90044-i / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046829789 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Improved limitedness theorems on finite automata with distance functions
scientific article

    Statements

    Improved limitedness theorems on finite automata with distance functions (English)
    0 references
    1990
    0 references
    Let \({\mathcal A}\) be a finite automaton with a distance function, and ID(\({\mathcal A})\) be the set of distances associated with words accepted by \({\mathcal A}\). This paper presents an improved upper bound of ID(\({\mathcal A})\) when the upper limit of ID(\({\mathcal A})\) is finite. It also presents one necessary and sufficient condition concerning \((word,+)\)-expressions for the upper limit of ID(\({\mathcal A})\) to be infinite.
    0 references
    finite automaton
    0 references
    distance function
    0 references
    upper bound
    0 references

    Identifiers