2005
DOI: 10.1007/11549345_38
|View full text |Cite
|
Sign up to set email alerts
|

Languages Representable by Vertex-Labeled Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Development of the models and methods for the automata theory and experiments, determining the general methodology of the behavioral test analysis, removes the upper bounds of applicability of the test automata models [13,14]. Complexity reduction, first of all, the reduction of the time of behavioral tests synthesis in a class of errors of mapping with the substantially saved values of the check completeness, is reached by:  the distributed network [15,16,17] and throughhierarchical [18] methods, reducing polynomially the dimension of the test synthesis and its duration due to the decomposition;  the evolutionary-genetic methods [19][20][21], which have the upper bounds of complexity of the determined methods and give polynomially smaller experimental values of complexity of the tests synthesis for the majority of cases [22]. Nevertheless, the synthesis of behavioral tests of the acceptable check completeness is possible for DIS with an average degree of complexity; it refers to the test of NP-complex class despite this reduction.…”
Section: Analysis Of Existing Solutionsmentioning
confidence: 99%
“…Development of the models and methods for the automata theory and experiments, determining the general methodology of the behavioral test analysis, removes the upper bounds of applicability of the test automata models [13,14]. Complexity reduction, first of all, the reduction of the time of behavioral tests synthesis in a class of errors of mapping with the substantially saved values of the check completeness, is reached by:  the distributed network [15,16,17] and throughhierarchical [18] methods, reducing polynomially the dimension of the test synthesis and its duration due to the decomposition;  the evolutionary-genetic methods [19][20][21], which have the upper bounds of complexity of the determined methods and give polynomially smaller experimental values of complexity of the tests synthesis for the majority of cases [22]. Nevertheless, the synthesis of behavioral tests of the acceptable check completeness is possible for DIS with an average degree of complexity; it refers to the test of NP-complex class despite this reduction.…”
Section: Analysis Of Existing Solutionsmentioning
confidence: 99%