Separating strings with small automata (Q1116698): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3725551 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5661970 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3746906 / rank | |||
Normal rank |
Latest revision as of 14:27, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Separating strings with small automata |
scientific article |
Statements
Separating strings with small automata (English)
0 references
1989
0 references
A finite deterministic complete automaton separates a pair u, v of input words if the actions of u and v are different. A problem arises of bounds for the function Sep(n) defined as the minimal number k of states such that for any pair, u, v of words of length at most n over a finite alphabet A one can produce a k-state automaton separating the pair. The paper brings the best yet known upper bound, to wit, \(Sep(n)=O(n^{2/5} \log^{3/5} n)\). The author regards the estimate \(O(n^{\epsilon})\) for any positive \(\epsilon\), conjectured by Ch. Choffrut, as unlikely.
0 references
finite automaton
0 references
rational function
0 references
deterministic complete automaton
0 references