Victor L. Selivanov

Comput., 2024

Universal Boolean Algebras with Applications to Semantic Classes of Models.

[BibT_eX]

[DOI]

Mikhail G. Peretyat'kin

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

Descriptive complexity of qcb0-spaces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Wadge Degrees of Classes of ω-Regular k-Partitions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2023

Primitive recursive ordered fields and some applications.

[BibT_eX]

[DOI]

Comput., 2023

Extending Wagner's Hierarchy to Deterministic Visibly Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Unity of Logic and Computation, 2023

Logic vs Topology on Regular ømega-languages.

[BibT_eX]

[DOI]

Vladislav Orekhovskii

Proceedings of the Unity of Logic and Computation, 2023

2022

A Q-Wadge Hierarchy in quasi-Polish Spaces.

[BibT_eX]

[DOI]

J. Symb. Log., 2022

Non-collapse of the effective Wadge hierarchy.

[BibT_eX]

[DOI]

Comput., 2022

Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Revolutions and Revelations in Computability, 2022

Enumerating Classes of Effective Quasi-Polish Spaces.

[BibT_eX]

[DOI]

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).

[BibT_eX]

[DOI]

Mathieu Hoyrup

Arno Pauly

Mariya Ivanova Soskova

Dagstuhl Reports, 2021

Wadge Degrees of Classes of omega-Regular k-Partitions.

[BibT_eX]

[DOI]

CoRR, 2021

Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision.

[BibT_eX]

[DOI]

Comput., 2021

Complexity Issues for the Iterated h-Preorders.

[BibT_eX]

[DOI]

Pavel Alaev

Proceedings of the Descriptional Complexity of Formal Systems, 2021

Input-Driven Pushdown Automata on Well-Nested Infinite Strings.

[BibT_eX]

[DOI]

Alexander Okhotin

Proceedings of the Computer Science - Theory and Applications, 2021

Searching for Applicable Versions of Computable Structures.

[BibT_eX]

[DOI]

Pavel Alaev

Proceedings of the Connecting with Computability, 2021

2020

Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties.

[BibT_eX]

[DOI]

Alexander Okhotin

CoRR, 2020

Q-Wadge degrees as free structures.

[BibT_eX]

[DOI]

Comput., 2020

Turing reducibility in the fine hierarchy.

[BibT_eX]

[DOI]

Alexander G. Melnikov

Mars M. Yamaleev

Ann. Pure Appl. Log., 2020

Classifying ømega-Regular Aperiodic k-Partitions.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2020

Degrees of Non-computability of Homeomorphism Types of Polish Spaces.

[BibT_eX]

[DOI]

Mathieu Hoyrup

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Effective Wadge Hierarchy in Computable Quasi-Polish Spaces.

[BibT_eX]

[DOI]

CoRR, 2019

Wadge-like degrees of Borel bqo-valued functions.

[BibT_eX]

[DOI]

CoRR, 2019

On Classes of Regular Languages Related to Monotone WQOs.

[BibT_eX]

[DOI]

Mizuhito Ogawa

Proceedings of the Descriptional Complexity of Formal Systems, 2019

Computability on Quasi-Polish Spaces.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Well Quasiorders and Hierarchy Theory.

[BibT_eX]

[DOI]

CoRR, 2018

Extending Cooper's theorem to Δ 3 0 Turing degrees.

[BibT_eX]

[DOI]

Mars M. Yamaleev

Comput., 2018

Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract).

[BibT_eX]

[DOI]

Svetlana V. Selivanova

Proceedings of the Sailing Routes in the World of Computation, 2018

Polynomial-Time Presentations of Algebraic Number Fields.

[BibT_eX]

[DOI]

Pavel Alaev

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Towards a descriptive theory of cb0-spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

First Order Theories of Some Lattices of Open Sets.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

Extending Wadge Theory to k-Partitions.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Efficient algorithms for membership in boolean hierarchies of regular languages.

[BibT_eX]

[DOI]

Christian Glaßer

Heinz Schmitz

Theor. Comput. Sci., 2016

Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).

[BibT_eX]

[DOI]

Jean Goubault-Larrecq

Monika Seisenberger

Andreas Weiermann

Dagstuhl Reports, 2016

Base-complexity classifications of qcb0-spaces1.

[BibT_eX]

[DOI]

Comput., 2016

On the Lattices of Effectively Open Sets.

[BibT_eX]

[DOI]

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

The Boolean Algebra of Piecewise Testable Languages.

[BibT_eX]

[DOI]

Anton Konovalov

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Some hierarchies of QCB 0-spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Wadge-like reducibilities on arbitrary quasi-Polish spaces.

[BibT_eX]

[DOI]

Luca Motto Ros

Philipp Schlicht

Math. Struct. Comput. Sci., 2015

Preface to the special issue: Computing with infinite data: topological and logical foundations.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Duality in Computer Science (Dagstuhl Seminar 15441).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

Hyperprojective hierarchy of qcb0-spaces.

[BibT_eX]

[DOI]

Comput., 2015

Towards the Effective Descriptive Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

Base-Complexity Classifications of QCB0-Spaces.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Complexity issues for Preorders on finite labeled forests.

[BibT_eX]

[DOI]

Peter Hertling

Proceedings of the Logic, Computation, Hierarchies, 2014

2013

Duality in Computer Science (Dagstuhl Seminar 13311).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

Total Representations

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Boolean Algebras of Regular ω-Languages.

[BibT_eX]

[DOI]

Anton Konovalov

Proceedings of the Language and Automata Theory and Applications, 2013

2012

Fine hierarchies via Priestley duality.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

2011

The shrinking property for NP and coNP.

[BibT_eX]

[DOI]

Christian Glaßer

Christian Reitwießner

Theor. Comput. Sci., 2011

Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Boolean Algebras of Regular Languages.

[BibT_eX]

[DOI]

Anton Konovalov

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

A Fine Hierarchy of ω-Regular k-Partitions.

[BibT_eX]

[DOI]

Proceedings of the Models of Computation in Context, 2011

Complexity Issues for Preorders on Finite Labeled Forests.

[BibT_eX]

[DOI]

Peter Hertling

Proceedings of the Models of Computation in Context, 2011

2010

10501 Executive Summary - Advances and Applications of Automata on Words and Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

Undecidability in Weihrauch Degrees.

[BibT_eX]

[DOI]

Anton V. Zhukov

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Definability in the Subword Order.

[BibT_eX]

[DOI]

Lyudmila V. Yartseva

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Undecidability in Some Structures Related to Computation Theory.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

Computing the Solution Operators of Symmetric Hyperbolic Systems of PDE.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2009

Hierarchies and reducibilities on regular languages related to modulo counting.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

Definability in the h-quasiorder of labeled forests.

[BibT_eX]

[DOI]

Anton V. Zhukov

Ann. Pure Appl. Log., 2009

Definability in the Infix Order on Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Fine hierarchies and m-reducibilities in theoretical computer science.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Wadge Reducibility and Infinite Computations.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

Fine Hierarchy of Regular Aperiodic omega-Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Complexity of Topological Properties of Regular omega-Languages.

[BibT_eX]

[DOI]

Klaus W. Wagner

Fundam. Informaticae, 2008

Computing Solutions of Symmetric Hyperbolic Systems of PDE's.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

On the Difference Hierarchy in Countably Based T0-Spaces.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.

[BibT_eX]

[DOI]

Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations.

[BibT_eX]

[DOI]

Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.

[BibT_eX]

[DOI]

Klaus W. Wagner

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Hierarchies of Delta02-measurable k -partitions.

[BibT_eX]

[DOI]

Math. Log. Q., 2007

Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

On the Wadge Reducibility of k-Partitions.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Classifying omega-regular partitions.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Fine Hierarchy of Regular Aperiodic omega -Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

A Useful Undecidable Theory.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

Definability in the Homomorphic Quasiorder of Finite Labeled Forests.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

Towards a descriptive set theory for domain-like structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

A reducibility for the dot-depth hierarchy.

[BibT_eX]

[DOI]

Klaus W. Wagner

Theor. Comput. Sci., 2005

Hierarchies in phi-spaces and applications.

[BibT_eX]

[DOI]

Math. Log. Q., 2005

Some Reducibilities on Regular Sets.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

Variations on Wadge Reducibility Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

2003

Wadge Degrees of [omega]-Languages of Deterministic Turing Machines.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2003

2002

Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

2001

A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

1998

Fine Hierarchy of Regular Omega-Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1996

On Recursively Enumerable Structures.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1996

1995

Fine Hierarchies and Boolean Terms.

[BibT_eX]

[DOI]

J. Symb. Log., 1995

1994

Recursiveness of ω-Operations.

[BibT_eX]

[DOI]

Math. Log. Q., 1994

Two Refinements of the Polynomial Hierarcht.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

1987

Index-Sets of Factor-Objects of the Post Numbering.

[BibT_eX]

[DOI]