Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
11887 | 947 | 19.8 | 31% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Cluster id | Level | Cluster label | #P |
---|---|---|---|
9 | 4 | COMPUTER SCIENCE, THEORY & METHODS//COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE//COMPUTER SCIENCE, INFORMATION SYSTEMS | 1247339 |
621 | 3 | MEMBRANE COMPUTING//THEORETICAL COMPUTER SCIENCE//LOGIC | 13680 |
1059 | 2 | MEMBRANE COMPUTING//THEORETICAL COMPUTER SCIENCE//P SYSTEMS | 10031 |
11887 | 1 | STATE COMPLEXITY//DESCRIPTIONAL COMPLEXITY//FINITE AUTOMATA | 947 |
Terms with highest relevance score |
rank | Term | termType | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|---|
1 | STATE COMPLEXITY | authKW | 1705540 | 8% | 73% | 72 |
2 | DESCRIPTIONAL COMPLEXITY | authKW | 1381319 | 8% | 60% | 72 |
3 | FINITE AUTOMATA | authKW | 881612 | 10% | 28% | 96 |
4 | REGULAR EXPRESSIONS | authKW | 775873 | 8% | 32% | 76 |
5 | REGULAR LANGUAGES | authKW | 527165 | 8% | 23% | 72 |
6 | COMBINED OPERATIONS | authKW | 375180 | 2% | 73% | 16 |
7 | LIFAR | address | 357284 | 3% | 43% | 26 |
8 | TWO WAY FINITE AUTOMATA | authKW | 225700 | 1% | 100% | 7 |
9 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | journal | 207220 | 8% | 8% | 78 |
10 | DISTANCE AUTOMATA | authKW | 193457 | 1% | 100% | 6 |
Web of Science journal categories |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | Computer Science, Theory & Methods | 58148 | 68% | 0% | 641 |
2 | Computer Science, Software Engineering | 6590 | 20% | 0% | 185 |
3 | Computer Science, Information Systems | 4459 | 18% | 0% | 172 |
4 | Mathematics, Applied | 1612 | 17% | 0% | 164 |
5 | Computer Science, Hardware & Architecture | 921 | 6% | 0% | 55 |
6 | Logic | 346 | 1% | 0% | 13 |
7 | Computer Science, Artificial Intelligence | 172 | 4% | 0% | 39 |
8 | COMPUTER APPLICATIONS & CYBERNETICS | 105 | 0% | 0% | 3 |
9 | Mathematics | 81 | 6% | 0% | 53 |
10 | Computer Science, Cybernetics | 0 | 0% | 0% | 1 |
Address terms |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | LIFAR | 357284 | 3% | 43% | 26 |
2 | INFORMAT ROUEN | 105319 | 1% | 47% | 7 |
3 | LEHRSTUHL INFORMAT 1 | 74867 | 1% | 19% | 12 |
4 | LLI IRISA | 64486 | 0% | 100% | 2 |
5 | GRENOBLE | 46622 | 1% | 16% | 9 |
6 | INFORMAT FONDAMENTALE PLIQUEE ROUEN | 42989 | 0% | 67% | 2 |
7 | IPI PAN | 42989 | 0% | 67% | 2 |
8 | LITIS | 40729 | 2% | 8% | 15 |
9 | LIAFA | 37090 | 3% | 4% | 29 |
10 | INTELLIGENCE INTERACT | 34386 | 0% | 27% | 4 |
Journals |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 207220 | 8% | 8% | 78 |
2 | THEORETICAL COMPUTER SCIENCE | 130365 | 22% | 2% | 208 |
3 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS | 63144 | 3% | 7% | 28 |
4 | FUNDAMENTA INFORMATICAE | 31188 | 5% | 2% | 47 |
5 | INFORMATION AND COMPUTATION | 28224 | 5% | 2% | 43 |
6 | RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 24812 | 2% | 4% | 20 |
7 | JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 16056 | 3% | 2% | 33 |
8 | LECTURE NOTES IN COMPUTER SCIENCE | 14593 | 21% | 0% | 201 |
9 | THEORY OF COMPUTING SYSTEMS | 10517 | 2% | 2% | 18 |
10 | INFORMATION PROCESSING LETTERS | 7679 | 4% | 1% | 39 |
Author Key Words |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | STATE COMPLEXITY | 1705540 | 8% | 73% | 72 | Search STATE+COMPLEXITY | Search STATE+COMPLEXITY |
2 | DESCRIPTIONAL COMPLEXITY | 1381319 | 8% | 60% | 72 | Search DESCRIPTIONAL+COMPLEXITY | Search DESCRIPTIONAL+COMPLEXITY |
3 | FINITE AUTOMATA | 881612 | 10% | 28% | 96 | Search FINITE+AUTOMATA | Search FINITE+AUTOMATA |
4 | REGULAR EXPRESSIONS | 775873 | 8% | 32% | 76 | Search REGULAR+EXPRESSIONS | Search REGULAR+EXPRESSIONS |
5 | REGULAR LANGUAGES | 527165 | 8% | 23% | 72 | Search REGULAR+LANGUAGES | Search REGULAR+LANGUAGES |
6 | COMBINED OPERATIONS | 375180 | 2% | 73% | 16 | Search COMBINED+OPERATIONS | Search COMBINED+OPERATIONS |
7 | TWO WAY FINITE AUTOMATA | 225700 | 1% | 100% | 7 | Search TWO+WAY+FINITE+AUTOMATA | Search TWO+WAY+FINITE+AUTOMATA |
8 | DISTANCE AUTOMATA | 193457 | 1% | 100% | 6 | Search DISTANCE+AUTOMATA | Search DISTANCE+AUTOMATA |
9 | UNARY LANGUAGES | 193445 | 1% | 50% | 12 | Search UNARY+LANGUAGES | Search UNARY+LANGUAGES |
10 | NONDETERMINISTIC FINITE AUTOMATA | 185706 | 1% | 48% | 12 | Search NONDETERMINISTIC+FINITE+AUTOMATA | Search NONDETERMINISTIC+FINITE+AUTOMATA |
Core articles |
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c: (1) Number of references referring to publications in the class. (2) Share of total number of active references referring to publications in the class. (3) Age of the article. New articles get higher score than old articles. (4) Citation rate, normalized to year. |
Rank | Reference | # ref. in cl. |
Shr. of ref. in cl. |
Citations |
---|---|---|---|---|
1 | GRUBER, H , HOLZER, M , (2015) FROM FINITE AUTOMATA TO REGULAR EXPRESSIONS AND BACK - A SUMMARY ON DESCRIPTIONAL COMPLEXITY.INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. VOL. 26. ISSUE 8. P. 1009 -1040 | 39 | 98% | 0 |
2 | HOLZER, M , KUTRIB, M , (2009) NONDETERMINISTIC FINITE AUTOMATA - RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY.INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. VOL. 20. ISSUE 4. P. 563 -580 | 34 | 100% | 11 |
3 | GOLDSTINE, J , (2002) DESCRIPTIONAL COMPLEXITY OF MACHINES WITH LIMITED RESOURCES.JOURNAL OF UNIVERSAL COMPUTER SCIENCE. VOL. 8. ISSUE 2. P. 193 -234 | 34 | 85% | 57 |
4 | KIRSTEN, D , (2008) A BURNSIDE APPROACH TO THE TERMINATION OF MOHRI'S ALGORITHM FOR POLYNOMIALLY AMBIGUOUS MIN-PLUS-AUTOMATA.RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS. VOL. 42. ISSUE 3. P. 553 -581 | 22 | 96% | 7 |
5 | PIGHIZZINI, G , (2015) INVESTIGATIONS ON AUTOMATA AND LANGUAGES OVER A UNARY ALPHABET.INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. VOL. 26. ISSUE 7. P. 827 -850 | 24 | 75% | 0 |
6 | KO, SK , EOM, HS , HAN, YS , (2016) OPERATIONAL STATE COMPLEXITY OF SUBTREE-FREE REGULAR TREE LANGUAGES.INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. VOL. 27. ISSUE 6. P. 705 -724 | 16 | 100% | 0 |
7 | PALIOUDAKIS, A , SALOMAA, K , AKL, SG , (2015) UNARY NFAS, LIMITED NONDETERMINISM, AND CHROBAK NORMAL FORM.INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING. VOL. 11. ISSUE 5-6. P. 395 -416 | 16 | 100% | 0 |
8 | COLCOMBET, T , (2013) REGULAR COST FUNCTIONS, PART I: LOGIC AND ALGEBRA OVER WORDS.LOGICAL METHODS IN COMPUTER SCIENCE. VOL. 9. ISSUE 3. P. - | 19 | 86% | 2 |
9 | EOM, HS , HAN, YS , SALOMAA, K , (2015) STATE COMPLEXITY OF K-UNION AND K-INTERSECTION FOR PREFIX-FREE REGULAR LANGUAGES.INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. VOL. 26. ISSUE 2. P. 211 -227 | 15 | 100% | 0 |
10 | GAO, Y , KARI, L , (2013) STATE COMPLEXITY OF STAR OF UNION AND SQUARE OF UNION ON K REGULAR LANGUAGES.THEORETICAL COMPUTER SCIENCE. VOL. 499. ISSUE . P. 38-50 | 14 | 100% | 3 |
Classes with closest relation at Level 1 |