Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Intersection non-emptiness problem (view)

searching for Emptiness problem 9 found (17 total)

Region (model checking) (2,734 words) [view diff] exact match in snippet view article

particular, it allows to reduce the emptiness problem for A {\displaystyle {\mathcal {A}}} to the emptiness problem for a finite or Büchi automaton. This

Alternating tree automata (98 words) [view diff] exact match in snippet view article find links to article

finite automaton extends nondeterministic finite automaton (NFA). The emptiness problem (deciding whether the language of an input ATA is empty) and the universality

Operator-precedence grammar (1,283 words) [view diff] exact match in snippet view article find links to article

largest known class closed under all these operations and for which the emptiness problem is decidable. Another peculiar feature of operator-precedence languages

Alternating finite automaton (808 words) [view diff] exact match in snippet view article find links to article

alphabet, i.e., when the automaton accepts a unary language. The non-emptiness problem (is the language of an input AFA non-empty?), the universality problem

Timed automaton (1,603 words) [view diff] exact match in snippet view article find links to article

complexity of some problems related to timed automata are now given. The emptiness problem for timed automata can be solved by constructing a region automaton

Deterministic finite automaton (3,659 words) [view diff] case mismatch in snippet view article find links to article

efficient algorithms to determine: whether a DFA accepts any strings (Emptiness Problem) whether a DFA accepts all strings (Universality Problem) whether

Nested word (3,063 words) [view diff] exact match in snippet view article find links to article

| A | 3 ℓ ) {\displaystyle O(|A|^{3}\ell )} . In particular, the emptiness problem is solvable in time O ( | A | 3 ) {\displaystyle O(|A|^{3})} . If

Alternating timed automaton (1,749 words) [view diff] exact match in snippet view article find links to article

intersection can be constructed from union and concatenation. The emptiness problem, the universality problem and the containability problem for OCATA

Intersection type discipline (2,302 words) [view diff] exact match in snippet view article find links to article

45–58. doi:10.1002/malq.19810270205. Urzyczyn, Paweł (1999). "The emptiness problem for intersection types". Journal of Symbolic Logic. 64 (3): 1195–1215