Regular solutions of language inequalities and well quasi-orders
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2005/12/01
-
Journal
-
Indian UGC (journal)
-
Refrences19
-
Citations7
-
Michal Kunc
Cite
Kunc, Michal. “Regular Solutions of Language Inequalities and Well Quasi-Orders”. Theoretical Computer Science, vol. 348, no. 2-3, 2005, pp. 277-93, https://doi.org/10.1016/j.tcs.2005.09.018.
Kunc, M. (2005). Regular solutions of language inequalities and well quasi-orders. Theoretical Computer Science, 348(2-3), 277-293. https://doi.org/10.1016/j.tcs.2005.09.018
Kunc, Michal. “Regular Solutions of Language Inequalities and Well Quasi-Orders”. Theoretical Computer Science 348, no. 2-3 (2005): 277-93. https://doi.org/10.1016/j.tcs.2005.09.018.
Kunc M. Regular solutions of language inequalities and well quasi-orders. Theoretical Computer Science. 2005;348(2-3):277-93.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Conway's problem for three-word sets | Theoretical Computer Science |
| 2002 | |
| The commutation of finite sets: a challenging problem | Theoretical Computer Science |
| 2002 | |
| The finite power problem revisited | Information Processing Letters |
| 2002 | |
| Efficient simplicity testing of automata | Theoretical Computer Science |
| 1992 | |
| On total regulators generated by derivation relations | Theoretical Computer Science |
| 8 | 1985 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words | Theory of Computing Systems |
| 2024 | |
| Weighted automata on infinite words in the context of Attacker–Defender games | Information and Computation |
| 1 | 2017 |
| Rational subsets and submonoids of wreath products | Information and Computation |
| 5 | 2015 |
| On effective construction of the greatest solution of language inequalityXA⊆BX | Theoretical Computer Science |
| 1 | 2014 |
| Well quasi-orders generated by a word-shuffle rewriting | Theoretical Computer Science |
| 1 | 2007 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 7
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Commutation with codes and was published in 2005. The most recent citation comes from a 2024 study titled Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words. This article reached its peak citation in 2024, with 1 citations. It has been cited in 3 different journals. Among related journals, the Theoretical Computer Science cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.