bile648
发表于 2025-3-25 07:09:04
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata,a can be recognized using nondeterministic logspace. Finally, we study the state complexity of projection languages for two-way two-dimensional automata, focusing on the language operations of union and diagonal concatenation.
phlegm
发表于 2025-3-25 07:44:30
https://doi.org/10.1007/978-94-007-5980-0of sizes ., where . and ., with . and ., describe all recursively enumerable languages, by explaining algorithms that transform a given type-0 grammar in some normal form to a GFID system of the required size.
ALIAS
发表于 2025-3-25 14:44:27
Leellen F. Solter,James J. Becnelstruction is adapted to use a fixed alphabet, resulting in shortest strings of length .. It is also shown that an .-state semi-direction-determinate 2DFA can be transformed to a one-way NFA with . states.
neolith
发表于 2025-3-25 18:59:17
James F. Campbell,Stephen P. Wraightxity of the context-free grammar too much. There is a conditional lower bound preventing to propose a linear-time parsing algorithm. Moreover, the grammar is able to simulate the 2-counter Minsky machine, which results in non-recursive trade-offs and undecidability of the emptiness problem.
STIT
发表于 2025-3-25 20:33:15
http://reply.papertrans.cn/27/2683/268291/268291_25.png
vector
发表于 2025-3-26 03:34:52
http://reply.papertrans.cn/27/2683/268291/268291_26.png
树木心
发表于 2025-3-26 07:23:13
Complexity of Two-Dimensional Rank-Reducing Grammars,xity of the context-free grammar too much. There is a conditional lower bound preventing to propose a linear-time parsing algorithm. Moreover, the grammar is able to simulate the 2-counter Minsky machine, which results in non-recursive trade-offs and undecidability of the emptiness problem.
noxious
发表于 2025-3-26 10:47:05
http://reply.papertrans.cn/27/2683/268291/268291_28.png
媒介
发表于 2025-3-26 14:45:56
Field Manual of Diseases on Trees and Shrubss crisp-determinizable if there exists an equivalent crisp-deterministic one. We prove that it is decidable whether weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids are crisp-determinizable.
Arrhythmia
发表于 2025-3-26 19:12:48
http://reply.papertrans.cn/27/2683/268291/268291_30.png