Reducing Acyclic Cover Transducers (Q3503893): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4540971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity relations and cover automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cover-automata for finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur une variante des fonctions séquentielles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing subsequential transducers: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the prefix of an automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization algorithms for sequential transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank

Latest revision as of 11:37, 28 June 2024

scientific article
Language Label Description Also known as
English
Reducing Acyclic Cover Transducers
scientific article

    Statements

    Identifiers