Interconvertibility of a class of set constraints and context-free-language reachability (Q1583350)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1521797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interconvertibility of a class of set constraints and context-free-language reachability |
scientific article; zbMATH DE number 1521797 |
Statements
Interconvertibility of a class of set constraints and context-free-language reachability (English)
0 references
26 October 2000
0 references
definite set constraints
0 references
context-free-language reachability
0 references
path problem
0 references
program analysis
0 references
complexity of program-analysis problems
0 references
0.7600454688072205
0 references
0.7564415335655212
0 references
0.7313133478164673
0 references
0.7309669852256775
0 references
0.7240161895751953
0 references
