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

抱怨

lactic

978-3-319-60251-6IFIP International Federation for Information Processing 2017

GUEER

Mhc-Molecule

https://doi.org/10.1007/978-3-319-48695-6ithmic 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.

清晰

https://doi.org/10.1007/978-3-031-52026-6 We introduce and study a new complexity measure, based on the . required for recognizing the language. Intuitively, the sensing cost quantifies the detail in which a random input word has to be read in order to decide its membership in the language. We study the sensing cost of regular and .-regula

commute

thwart

https://doi.org/10.1007/978-3-031-52026-6define . as the set of all integers . such that there are . languages ., ., with .In this paper we study these sets for the operation union, catenation, star, complement, set-subtraction, and intersection and the measure number of accepting states (defined for regular languages) as well as for rever

枪支

https://doi.org/10.1007/978-3-031-52026-6this work: input-altering, input-preserving, and input-decreasing. Two words are t-dependent, if one is the output of t when the other one is used as input. A t-independent language is one containing no two t-dependent words. Examples of independent languages are found in noiseless coding theory, no