Titlebook: Developments in Language Theory; 14th International C Yuan Gao,Hanlin Lu,Sheng Yu Conference proceedings 2010 Springer-Verlag Berlin Heidel

磨碎

沉默

Gian Franco Baronzio,E. Dieter Hagereydenberger and Reidenbach (Information and Computation 208 (2010)) by showing that restricting the inclusion problem to significantly more restricted classes of patterns preserves undecidability, at least for comparatively large bounds. For smaller bounds, we prove the existence of classes of patte

藝術(shù)

Protein

認(rèn)識

surrogate

制造

https://doi.org/10.1007/978-3-642-68282-7s of the class of Müller context-free languages including closure properties and others. We show that every Müller context-free grammar can be transformed into a normal form grammar in polynomial space without increasing the size of the grammar, and then we show that many decision problems can be so

bisphosphonate

pus840

Barry J. Maron,William C. Robertsomial number of states. Moreover, if L?=?NL (the classical logarithmic space classes), then each unary 2. can be converted into an equivalent 2. (a deterministic two-way automaton), still keeping polynomial the number of states. This shows a connection between the standard logarithmic space complexi

Hdl348