You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

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

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (10)

Journals (0)

1-10 of 10 results for nondeterministic Turing machines

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: On Restricted Bio-Turing Machines

Retricted access

Research article

First published 2011-6

On Restricted Bio-Turing Machines

Rama Raghavan, H. Ramesh, Marian Gheorghe [...]

Fundamenta Informaticae

Select article: One Pebble Versus ϵ · log n Bits

Retricted access

Research article

First published 2010-9

One Pebble Versus ϵ · log n Bits

Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti

Fundamenta Informaticae

Select article: The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

Retricted access

Research article

First published 2009-5

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati

Fundamenta Informaticae

Select article: Complexity Issues in Computational Biology

Retricted access

Research article

First published 2012-9

Complexity Issues in Computational Biology

Jacek Blazewicz, Marta Kasprzak

Fundamenta Informaticae

Select article: On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity

Retricted access

Research article

First published 2017-5-10

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity

Jiří Šíma, Stanislav Žák

Fundamenta Informaticae

Select article: The Complexity of Szilard Languages of Matrix Grammars Revisited

Retricted access

Research article

First published 2013-6

The Complexity of Szilard Languages of Matrix Grammars Revisited

Liliana Cojocaru, Erkki Mäkinen

Fundamenta Informaticae

Select article: Concurrent Program Schemes

Retricted access

Research article

First published 1987

Concurrent Program Schemes

A.J. Kfoury, P. Urzyczyn

Fundamenta Informaticae

Select article: Trade-Offs Between Time,Space,Cooperation,and Communication Complexity for CD Grammar Systems

Retricted access

Research article

First published 2011-3

Trade-Offs Between Time,Space,Cooperation,and Communication Complexity for CD Grammar Systems

Liliana Cojocaru

Fundamenta Informaticae

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

Retricted 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: Programmability and P = N P conjecture

Retricted access

Research article

First published 1978

Programmability and P = N P conjecture

Stanisław Radziszowski

Fundamenta Informaticae

1
10 / page

Article type

Publication date

Subjects

Access