Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Link opens in a new tab
Search content at Bar-Ilan University
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Reducing the time complexity of testing for local threshold testability
Avraham Trakhtman
Department of Mathematics
Research output
:
Chapter in Book/Report/Conference proceeding
›
Chapter
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Reducing the time complexity of testing for local threshold testability'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Time Complexity
100%
Testability
100%
Automata
100%
Local Threshold
100%
Substring
66%
Language L
66%
Suffix
33%
Locally Testable
33%
Prefix
33%
Non-negative Integer
33%
Semigroup
33%
C + +
33%
Deterministic Finite Automata
33%
Algorithm Complexity
33%
Finite Deterministic Automata
33%
Computer Science
Time Complexity
100%
Automaton
100%
Deterministic Finite Automaton
66%
Sufficient Condition
33%
Nonnegative Integer
33%
Mathematics
Necessary and Sufficient Condition
100%
Nonnegative Integer
100%
Semigroup
100%