The SCEAS System
| |||||||

## Search the dblp DataBase
Victor L. Selivanov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Oleg V. Kudinov, Victor L. Selivanov
**Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.**[Citation Graph (0, 0)][DBLP] CiE, 2006, pp:289-296 [Conf] - Victor L. Selivanov
**Some Reducibilities on Regular Sets.**[Citation Graph (0, 0)][DBLP] CiE, 2005, pp:430-439 [Conf] - Victor L. Selivanov
**Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.**[Citation Graph (0, 0)][DBLP] FCT, 2001, pp:323-334 [Conf] - Victor L. Selivanov
**Index-Sets of Factor-Objects of the Post Numbering.**[Citation Graph (0, 0)][DBLP] FCT, 1987, pp:396-400 [Conf] - Victor L. Selivanov, Klaus W. Wagner
**A Reducibility for the Dot-Depth Hierarchy.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:783-793 [Conf] - Victor L. Selivanov
**A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:539-550 [Conf] - Victor L. Selivanov
**Wadge Degrees of omega-Languages of Deterministic Turing Machines.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:97-108 [Conf] - Victor L. Selivanov
**Two Refinements of the Polynomial Hierarcht.**[Citation Graph (0, 0)][DBLP] STACS, 1994, pp:439-448 [Conf] - Victor L. Selivanov
**Fine Hierarchy of Regular omega-Languages.**[Citation Graph (0, 0)][DBLP] TAPSOFT, 1995, pp:277-287 [Conf] - Victor L. Selivanov
**On Recursively Enumerable Structures.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1996, v:78, n:1-3, pp:243-258 [Journal] - Victor L. Selivanov
**Variations on Wadge Reducibility Extended Abstract.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:120, n:, pp:159-171 [Journal] - Victor L. Selivanov
**Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies.**[Citation Graph (0, 0)][DBLP] ITA, 2002, v:36, n:1, pp:29-42 [Journal] - Victor L. Selivanov
**Wadge Degrees of [omega]-Languages of Deterministic Turing Machines.**[Citation Graph (0, 0)][DBLP] ITA, 2003, v:37, n:1, pp:67-83 [Journal] - Victor L. Selivanov
**Fine Hierarchies and Boolean Terms.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1995, v:60, n:1, pp:289-317 [Journal] - Victor L. Selivanov
**Recursiveness of**[Citation Graph (0, 0)][DBLP]*omega*-Operations. Math. Log. Q., 1994, v:40, n:, pp:204-206 [Journal] - Victor L. Selivanov
**Hierarchies in**[Citation Graph (0, 0)][DBLP]*phi*-spaces and applications. Math. Log. Q., 2005, v:51, n:1, pp:45-61 [Journal] - Victor L. Selivanov
**Towards a descriptive set theory for domain-like structures.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:365, n:3, pp:258-282 [Journal] - Victor L. Selivanov
**Fine Hierarchy of Regular Omega-Languages.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:191, n:1-2, pp:37-59 [Journal] - Victor L. Selivanov, Klaus W. Wagner
**A reducibility for the dot-depth hierarchy.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:448-472 [Journal] - Oleg V. Kudinov, Victor L. Selivanov
**Definability in the Homomorphic Quasiorder of Finite Labeled Forests.**[Citation Graph (0, 0)][DBLP] CiE, 2007, pp:436-445 [Conf] - Victor L. Selivanov
**A Useful Undecidable Theory.**[Citation Graph (0, 0)][DBLP] CiE, 2007, pp:685-694 [Conf] - Victor L. Selivanov
**Fine Hierarchy of Regular Aperiodic**[Citation Graph (0, 0)][DBLP]*omega*-Languages. Developments in Language Theory, 2007, pp:399-410 [Conf] **Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.**[Citation Graph (, )][DBLP]**The Shrinking Property for NP and coNP.**[Citation Graph (, )][DBLP]**A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.**[Citation Graph (, )][DBLP]**Undecidability in Weihrauch Degrees.**[Citation Graph (, )][DBLP]**Definability in the Subword Order.**[Citation Graph (, )][DBLP]**Complexity of Topological Properties of Regular omega-Languages.**[Citation Graph (, )][DBLP]**Definability in the Infix Order on Words.**[Citation Graph (, )][DBLP]**Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.**[Citation Graph (, )][DBLP]**Definability in the h-quasiorder of labeled forests.**[Citation Graph (, )][DBLP]**Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages**[Citation Graph (, )][DBLP]**The Shrinking Property for NP and coNP.**[Citation Graph (, )][DBLP]**Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.**[Citation Graph (, )][DBLP]**On the Wadge Reducibility of k-Partitions.**[Citation Graph (, )][DBLP]**Computing Solutions of Symmetric Hyperbolic Systems of PDE's.**[Citation Graph (, )][DBLP]**On the Difference Hierarchy in Countably Based T**[Citation Graph (, )][DBLP]_{0}-Spaces.
Search in 0.711secs, Finished in 0.713secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |