arXiv subjects
Publications and source records attributed to J. Andres Montoya.
Let L denote the class Logpsace and NL the class NLogspace. We use logCFL to denote the closure under logspace reductions of the set of context-free languages. We prove that NL is different from logCFL. This result implies L different from Ptime and the stronger separation NL different from Ptime.
We prove that the class LOGSPACE (L, for short) is different from the class NP.
We prove that NL is strictly contained in P. We get this separation as a corollary of the following result: the set of context-free languages is not contained in NL. The reader should recall that CFL is contained in DTIME(n^3)
Planar automata seems to be representative of the synchronizing behavior of deterministic finite state automata. We conjecture that Černy's conjecture holds true, if and only if, it holds true for planar automata. In this paper we have gathered some evidence concerning this conjecture. This evidence amounts to show that the class of planar automata is representative of the algorithmic hardness of synchronization
We prove that the almost-entropic region of order four is not semialgebraic, we get as a corollary the well-known Theorem of Matus, which asserts that this region is not polyhedral