On geometric automata which can nondeterministically choose auxiliary points
Ulrich Huckenbeck (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Undecidable event detection problems for ODEs of dimension one and two”
On geometric automata which can nondeterministically choose auxiliary points
On the complexity of computable real sequences
Jacobo Torán (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Relationships among , , and the determinant
Eric Allender, Mitsunori Ogihara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Closure properties of certain families of formal languages with respect to a generalization of cyclic closure
Andreas Brandstadt (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Monotonous and randomized reductions to sparse sets
V. Arvind, J. Köbler, M. Mundhenk (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I Ko (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An algorithm for the solution of fixed-point equations for infinite words
Stephan Heilbrunner (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: