Titlebook: Descriptional Complexity of Formal Systems; 22nd International C Galina Jirásková,Giovanni Pighizzini Conference proceedings 2020 Springer

bile648

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

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

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

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

vector

树木心

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

媒介

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