|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 12 keywords
|
|
|
Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
133 | Oleg V. Kudinov, Victor L. Selivanov |
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 289-296, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
homomorphic quasiorder, elementary theory, Tree, undecidability, forest, labeled tree |
109 | Oleg V. Kudinov, Victor L. Selivanov |
Definability in the Homomorphic Quasiorder of Finite Labeled Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 436-445, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
homomorphic quasiorder, atomic structure, definability, forest, automorphism, Labeled tree |
85 | K. Cipková |
On a quasiorder on the class of monounary algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 10(6), pp. 471-475, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Monounary algebra, Degree of element, endomorphism, Quasiorder, homomorphism |
51 | Oleg V. Kudinov, Victor L. Selivanov |
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 290-299, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Gandy theorem, least fixed point, biinterpretability, labeled forest, h-quasiorder, definability |
34 | Samuel Braunfeld, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz |
On the first-order transduction quasiorder of hereditary classes of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.14412, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
34 | Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz |
Structural Properties of the First-Order Transduction Quasiorder. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference)., pp. 31:1-31:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-218-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
34 | Pierre Ganty, Elena Gutiérrez, Pedro Valero 0001 |
A Quasiorder-based Perspective on Residual Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.00359, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
34 | Pierre Ganty, Elena Gutiérrez, Pedro Valero 0001 |
A Quasiorder-Based Perspective on Residual Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic., pp. 40:1-40:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-159-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
34 | Jouni Järvinen, Sándor Radeleczki |
Monteiro Spaces and Rough Sets Determined by Quasiorder Relations: Models for Nelson algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 131(2), pp. 205-215, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
34 | Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov |
Definability in the h-quasiorder of labeled forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 159(3), pp. 318-332, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Oleg V. Kudinov, Victor L. Selivanov |
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 17(6), pp. 1135-1151, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Jürg Schmid |
Quasiorders and Sublattices of Distributive Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 19(1), pp. 11-34, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
quasiorder, sublattice, distributive lattice, representation theory |
27 | Radim Belohlávek |
Fuzzy closure operators II: induced relations, representation, and examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 7(1), pp. 53-64, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Fuzzy equivalence, Fuzzy quasiorder, Consequence relation, Closure operator |
24 | Jouni Järvinen, Sándor Radeleczki, Laura Veres |
Rough Sets Determined by Quasiorders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 26(4), pp. 337-355, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) Primary 06A06, Secondary 06D10, 06D15, 68T37 |
24 | Oleg V. Kudinov, Victor L. Selivanov |
Definability in the Infix Order on Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings, pp. 454-465, 2009, Springer, 978-3-642-02736-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Infix order, least fixed point, biinterpretability, definability, automorphism, first-order theory |
24 | Frithjof Dau |
Concept Graphs and Predicate Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Broadening the Base, 9th International Conference on Conceptual Structures, ICCS 2001, Stanford, CA, USA, July 30-August 3, 2001, Proceedings, pp. 72-86, 2001, Springer, 3-540-42344-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #16 of 16 (100 per page; Change: )
|
|