Titlebook: Descriptional Complexity of Formal Systems; 14th International W Martin Kutrib,Nelma Moreira,Rogério Reis Conference proceedings 2012 Sprin

BABY

State Complexity of Chop Operations on Unary and Finite Languagesuching letters merged if they are equal, otherwise their chop is undefined. The iterated variants chop-star and chop-plus are defined similar as the classical operations Kleene star and plus. We investigate the state complexity of chop operations on unary and/or finite languages, and obtain similar

是剝皮

perpetual

hedonic

誹謗

On Internal Contextual Grammars with Subregular Selection Languagesconsider families . which are obtained by restriction to . states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by internal contextual grammars with selection languages in

擔(dān)心

An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited P symbol and the current pushdown-store top. In this paper, we consider stateless pushdown automata whose size of their pushdown alphabet is limited by a positive integer. More specifically, we establish an infinite hierarchy of language families resulting from stateless pushdown automata with limite

GREEN

Neuralgia

Minicomplexity, old theorems. We then record recent advances, both in the theory itself and in its relation to Turing machine complexity. Finally, we illustrate a proof technique, which we call .. The entire talk follows, extends, and advocates the Sakoda-Sipser framework.

Rustproof

Logical Analysis of Hybrid Systemselative to discrete systems. Moreover, there is a constructive reduction of properties of hybrid systems to corresponding properties of continuous systems or to corresponding properties of discrete systems. We briefly summarize and discuss some of the implications of these results.

Frequency

State Complexity of Star and Square of Union of , Regular Languagesmultiple combined operations and show that they are much lower than the mathematical compositions of the state complexities of their basic individual component operations, but have similar forms with the state complexities of some participating combined operations.