Separating Words from Every Start State with Horner Automata (Q6204139): 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 / OpenAlex ID
 
Property / OpenAlex ID: W4386400098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal DFA for testing divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating words and trace reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating strings with small automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations of the separating words problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating words by occurrences of subwords / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:33, 29 August 2024

scientific article; zbMATH DE number 7828953
Language Label Description Also known as
English
Separating Words from Every Start State with Horner Automata
scientific article; zbMATH DE number 7828953

    Statements