Article thumbnail

Some bounds on the complexity of predicate recognition by finite automata

By Y. Breitbart


Let p(n) be the smallest number such that some finite automaton with p(n) internal states exists which recognizes predicate P over the set of words of length not greater than n. Then there exists a predicate P defined on (0, 1)* such that an infinite sequence n1, n2,…,nk…, when nk→∞ as k→∞ can be constructed for which T(nk)∼ 2nk+2/nk, where T(x)=P(x) or P(xR), for xR is the reverse of x

Publisher: Published by Elsevier Inc.
Year: 1976
DOI identifier: 10.1016/S0022-0000(76)80005-0
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3-eu-west-1.amazonaws... (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.