Titlebook: Developments in Language Theory; 13th International C Volker Diekert,Dirk Nowotka Conference proceedings 2009 Springer-Verlag Berlin Heidel

坚毅

Gerald R. Cunha,Laurence Baskin that there is a clopen partition separating two words if and only if the words do not commute. We can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.

Malfunction

leniency

Closures in Formal Languages and Kuratowski’s Theorem that there is a clopen partition separating two words if and only if the words do not commute. We can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.

不整齐

On Stateless Multihead Finite Automata and Multihead Pushdown Automatatter than . heads..We also study stateless multihead pushdown automata in their two-way and one-way, deterministic and nondeterministic variations and show that for all these varieties, . + 1 heads allow more computational power than . heads. Finally, we give some characterizations of stateless multihead finite and multihead pushdown automata.

Campaign

FRAX-tool

0302-9743 Overview: 978-3-642-02736-9978-3-642-02737-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

思想流动

Allowance

Rejuvenate

Phosphate Control of PTH Secretion{.,.}.. For the subclass of automata whose transition monoids have the property that each regular -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.

和平主义

Ned J. Place,Stephen E. Glickmanelating them with . words. In particular, some new characterizations of rich words and rich palindromes are given. We also prove that a periodic-like word is rich if and only if the square of its fractional root is also rich.