Titlebook: Implementation and Application of Automata; 15th International C Michael Domaratzki,Kai Salomaa Conference proceedings 2011 Springer Berlin

巨碩

invulnerable

Using Automata to Describe Self-Assembled Nanostructures,tals, biomolecular cages such as viral capsids and for computing. We show an algebraic model for describing and characterizing nanostructures built by a set of molecular building blocks. This algebraic approach connects the classifcal view of crystal dissection with a more modern system based on algebraic automata theory.

depreciate

流逝

壓迫

On Lazy Representations and Sturmian Graphs,al number .. We prove that for any non-negative integer . the unique path weighted . in the Sturmian graph associated with . represents the lazy representation of . in the Ostrowski numeration system associated with .. Moreover, we provide several properties of the representations of the natural integers in this numeration system.

有惡臭

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata,ministic restarting automata yield a characterization of pushdown transductions. Then we study the class of transductions that are computed by . (PC-systems) of monotone deterministic restarting automata. We will see that this class includes all transductions that are computable.

DAFT

stressors

BROW

好開(kāi)玩笑

Implementation and Application of Automata978-3-642-18098-9Series ISSN 0302-9743 Series E-ISSN 1611-3349