Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

All content on this site: Copyright © 2026 Sage Publications. All rights reserved. This website is technically supported and operated by China National Publications Import and Export (Group) Co., Ltd. 京ICP备09090397号-11

Search results

Search results page

Articles (3)

Journals (0)

1-3 of 3 results for highly undecidable problems

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Highly Undecidable Problems about Recognizability by Tiling Systems

Restricted access

Research article

First published May, 2009

Highly Undecidable Problems about Recognizability by Tiling Systems

Olivier Finkel

Fundamenta Informaticae

Select article: On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words

Restricted access

Research article

First published 2021

On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words

Olivier Finkel, Michał Skrzypczak

Fundamenta Informaticae

Select article: Classes of Timed Automata and the Undecidability of Universality

Restricted access

Research article

First published January, 2008

Classes of Timed Automata and the Undecidability of Universality

Arnaldo V. Moura, Guilherme A. Pinto

Fundamenta Informaticae

1
10 / page

Filter Results

Article type

Publication date

Subjects

Access