A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000587532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Determinization of Weighted Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorization forests of finite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized recurrent systems for image generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for determining relative star height and star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved limitedness theorems on finite automata with distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds to the limitedness of distance automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity method for measuring nondeterminism in finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance desert automata and the star height problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3431481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitedness theorem on finite automata with distance functions: An algebraic proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limitedness problem on distance automata: Hashiguchi's method revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the star problem in trace monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization forests of finite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semigroups of matrices over the tropical semiring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance automata having large finite distance or finite ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-valued distance automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:42, 28 June 2024

scientific article
Language Label Description Also known as
English
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
scientific article

    Statements

    A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (English)
    0 references
    0 references
    0 references
    25 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references