Titlebook: Machines, Languages, and Complexity; 5th International Me J. Dassow,J. Kelemen Conference proceedings 1989 Springer-Verlag Berlin Heidelber

STERN

Machines, Languages, and Complexity978-3-540-48203-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

Factual

Hyperlipidemia

A remark on some classifications of Indian parallel languages,We discuss the descriptional complexity measures number of nonterminals, number of productions, and number of symbols of Indian parallel grammars and Indian parallel languages.

考得

A survey of two-dimensional automata theory,The main purpose of this paper is to survey several properties of alternating, nondeterministic, and deterministic two-dimensional Turing machines (including two-dimensional finite automata and marker automata), and to briefly survey cellular types of two-dimensional automata.

小步舞

The virtual floating grid file,In this paper, an extension of the grid-file structure is introduced which makes it possible to substantially decrease the number of disk accesses performed during the resolution of range or partial-match queries. An analysis of such decrease is presented for both the general and a particular case.

chemoprevention

The riches of rectangles,In this paper we consider some of the rectangle problems that have been studied in the literature of computational geometry. Our aim is to demonstrate that although rectangles are, perhaps, the simplest of geometrical figures, they occur naturally in many situations and, thus they are a rich source for intriguing and challenging problems.

aquatic

郊外

https://doi.org/10.1007/BFb0015922Algorithms; Automat; algorithm; artificial intelligence; automata; automata theory; complexity; computation

未完成

The simulation of two-dimensional one-marker automata by three-way turing machines,(nondeterministic) Turing machine by "TR2-DTM" ("TR2-NTM"). In this paper, we show that the necessary and sufficient space for TR2-NTM‘s to simulate 2-DM.‘s (2-NM.‘s) is .log. (..), and the necessary and sufficient space for TR2-DTM‘s to simulate 2-DM.‘s (2-NM.‘s) is 2. (2.(n.)), where . is the number of columns of rectangular input tapes.

STAT

A partially persistent data structure for the set-union problem with backtracking, are possible. A partially persistent data structure is presented which maintains a partitions of an . set and performs each ., each . and each search in the past in . time per operation, at the same time allowing to backtrack, over the sequence of . in costant time. The space complexity of such a structure is ..