PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA (Q3503094): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5452362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational method for optimal control of a linear system by quadratic programming† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Techniques: Regular expression search algorithm / rank
 
Normal rank

Revision as of 09:25, 28 June 2024

scientific article
Language Label Description Also known as
English
PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
scientific article

    Statements

    PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2008
    0 references
    Removal of \(\varepsilon\)-transitions
    0 references
    partial removal
    0 references
    weighted finite automaton
    0 references
    hard-ware acceleration
    0 references
    chains of \(\varepsilon\)-transitions
    0 references

    Identifiers