Polynomially ambiguous unary weighted automata over fields (Q6038711): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-022-10107-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4308713541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncommutative rational Pólya series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially Ambiguous Probabilistic Automata on Restricted Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5155668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirings and Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Vandermonde Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata / 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: Sequential? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguity hierarchies for weighted tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copyless cost-register automata: structure, expressiveness, and closure properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039989 / 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: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Field Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational and Recognisable Power Series / 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: On the degree of ambiguity of finite automata / rank
 
Normal rank

Latest revision as of 00:57, 1 August 2024

scientific article; zbMATH DE number 7681310
Language Label Description Also known as
English
Polynomially ambiguous unary weighted automata over fields
scientific article; zbMATH DE number 7681310

    Statements

    Polynomially ambiguous unary weighted automata over fields (English)
    0 references
    0 references
    2 May 2023
    0 references
    weighted automaton
    0 references
    formal power series
    0 references
    difference equation
    0 references
    linear recurrence
    0 references
    polynomial ambiguity
    0 references
    field
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references