Sage Journals: Discover world-class research

Retricted access

Research article

First published 1977

Sets of sequences constructed by nondeterministic k -machines and deterministic k -machines

Jiří Karásek

Fundamenta Informaticae

Retricted access

Research article

First published 2006-10

Nondeterministic Bimachines and Rational Relations with Finite Codomain

Nicolae Santean, Sheng Yu

Fundamenta Informaticae

Retricted access

Research article

First published 1994-12

THE COMPLEXITY OF LOCAL STRATIFICATION

Peter Cholak, Howard A. Blair

Fundamenta Informaticae

Retricted access

Research article

First published 2011-6

On Restricted Bio-Turing Machines

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

Fundamenta Informaticae

Retricted access

Research article

First published 2012-7

A Survey of Results on Stateless Multicounter Automata

Oscar H. Ibarra, Ömer Eğecioğlu

Fundamenta Informaticae

Free access

Research article

First published 2012-2

Tree Representations via Ordinal Machines

Philipp Schlicht, Benjamin Seyfferth

Computability

Retricted access

Research article

First published 2010-9

One Pebble Versus ϵ · log n Bits

Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti

Fundamenta Informaticae

Retricted access

Research article

First published 2019-11

A three-phase workflow for general and expressive representations of nondeterminism in HPC applications

Dylan Chapp, Danny Rorabaugh, Kento Sato [...]

The International Journal of High Performance Computing Applications

Retricted access

Research article

First published 2021

Self-Verifying Pushdown and Queue Automata

Henning Fernau, Martin Kutrib, Matthias Wendlandt

Fundamenta Informaticae

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

Search results