Titlebook: Combinatorics, Computability and Logic; Proceedings of the T C. S. Calude,M. J. Dinneen,S. Sburlan Conference proceedings 2001 Springer-Ver

友好關(guān)系

https://doi.org/10.1007/978-1-4471-0717-0Automat; Graph; Matching; Sim; algorithms; automata; complexity; formal language; logic; algorithm analysis a

FID

Strength

Recursive Functions: An Archeological Lookand how the basic ideas and methods used in a restricted area of Logic derive from, or at least interact with, a wider mathematical and intellectual experience. I can only offer suggestions, not scholarly arguments, to those who share my interest.

Nerve-Block

Lex Ideals of Generalized MV-Algebrasras and unital .-groups, we describe the ordered sets of prime and regular ideals of GMV-algebras induced on principal ideals, study lexicographic extensions of ideals of GMV-algebras and describe basic GMV-algebras.

brachial-plexus

liposuction

On Relax-ability of Word-Order by D-grammarsn of DR-(non)projectivity. We obtain two infinite scales of classes of languages using different degrees of relaxation. The one scale contains the class of context-free languages as its first (minimal) element, the other one starts by the class of regular languages.

小官

On the Structure of Linear Cellular Automataesented together with their properties in the first section of the paper. We characterize linear functions which are global transition functions for certain bounded linear cellular automata. Finally, some results concerning the limit sets and a remarkable structure for isometric linear cellular automata are also included.

不如樂死去

hedonic

逗留

A Loopless Generation of Bitstrings without , Consecutive Onesregarded as the subsets of {1, 2,…, .} without . consecutive elements and bitstrings in .. code a particular class of trees or compositions of an integer. In this paper we give a Gray code for .. which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.