Titlebook: Descriptional Complexity of Formal Systems; 19th IFIP WG 1.02 In Giovanni Pighizzini,Cezar Câmpeanu Conference proceedings 2017 IFIP Intern

Biomarker

幸福愉悦感

通情达理

Most Complex Non-returning Regular Languagesom, Han and Jirásková derived upper bounds on the state complexity of boolean operations and Kleene star, and proved that these bounds are tight using two different binary witnesses. They derived upper bounds for concatenation and reversal using three different ternary witnesses. These five witnesse

disciplined

Uncountable Realtime Probabilistic Classesithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the same result for double logarithmic space, which is tight. When replacing the worktape with some limited memories, we can follow uncountable results on unary languages for two counters.

比赛用背带

下级

Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearitynent contains some insertion-deletion rules. A rule is applied to a string in a component and the resultant string is moved to the target component specified in the rule. When resources are so limited (especially, when deletion is context-free) then GCID systems are not known to describe the class o

Homocystinuria

gnarled

Self-attraction Removal from Oritatami Systemss a computational model of this phenomenon, which lets its transcript, a sequence of beads (abstract molecules) fold cotranscriptionally via interactions between beads according to its ruleset. In this paper, we study the problem of removing self-attractions, which lets a bead interact with another

Prognosis

LUMEN

Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages possible algebras, and for each of them, we provide an answer to the question whether or not it can be generated by a suffix-, factor-, or subword-free language. In each case when an algebra can be generated by such a language, we show that this language may be taken to be regular, and we compute u