Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (Q6154973): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054123480027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4381164191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5694616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance evaluation of (max,+) automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and analysis of timed Petri nets using heaps of pieces / 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: DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic characterization of semirings for which the support of every recognizable series is recognizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finite and Polynomial Ambiguity of Weighted Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite sequentiality of unambiguous max-plus tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coarse-to-fine natural language processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of a family of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804221 / 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 09:53, 27 August 2024

scientific article; zbMATH DE number 7805936
Language Label Description Also known as
English
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
scientific article; zbMATH DE number 7805936

    Statements

    Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (English)
    0 references
    0 references
    16 February 2024
    0 references
    weighted tree automata
    0 references
    max-plus tree automata
    0 references
    decidability
    0 references
    equivalence
    0 references
    unambiguity
    0 references
    sequentiality
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references