Turing Machines with Sublogarithmic Space

Turing Machines with Sublogarithmic Space

The purpose of this book is to gather contributions from scientists in fluid mechanics who use asymptotic methods to cope with difficult problems.

Author: Andrzej Szepietowski

Publisher: Springer Science & Business Media

ISBN: 3540583556

Category: Computers

Page: 114

View: 578

The purpose of this book is to gather contributions from scientists in fluid mechanics who use asymptotic methods to cope with difficult problems. The selected topics are as follows: vorticity and turbulence, hydrodynamic instability, non-linear waves, aerodynamics and rarefied gas flows. The last chapter of the book broadens the perspective with an overview of other issues pertaining to asymptotics, presented in a didactic way.
Categories: Computers

Parallel Image Analysis

Parallel Image Analysis

We first investigate the sufficient spaces of three - way Turing machines to simulate two - dimensional inkdot ... inkdot Turing machines are more powerful than nondeterministic ordinary Turing machines for sublogarithmic space bounds .

Author: L. S. Davis

Publisher: World Scientific

ISBN: 9810224761

Category: Technology & Engineering

Page: 246

View: 632

This volume deals with the following topics: 2-D, 3-D automata and grammars, parallel architecture for image processing, parallel digital geometry algorithms, data allocation strategies for parallel image processing algorithms, complexity analysis of parallel image operators. The contributions are written by leading experts in the fields of models, algorithms and architectures for parallel image processing.
Categories: Technology & Engineering

Parallel Image Analysis Theory and Applications

Parallel Image Analysis  Theory and Applications

We first investigate the sufficient spaces of three-way Turing machines to simulate two-dimensional inkdot finite ... Turing machines are more powerful than nondeterministic ordinary Turing machines for sublogarithmic space bounds.

Author: L S Davis

Publisher: World Scientific

ISBN: 9789814499613

Category: Computers

Page: 252

View: 257

This volume deals with the following topics: 2-D, 3-D automata and grammars, parallel architecture for image processing, parallel digital geometry algorithms, data allocation strategies for parallel image processing algorithms, complexity analysis of parallel image operators. The contributions are written by leading experts in the fields of models, algorithms and architectures for parallel image processing. Contents:Data Allocation Strategies for Parallel Image Processing Algorithms (V Marion-Poty & S Miguet)Facilitating High-Performance Image Analysis on Reduced Hypercube (RH) Parallel Computers (S G Ziavras & M A Sideras)Time-Optimal Digital Geometry Algorithms on Meshes with Multiple Broadcasting (V Bokka et al.)A Time-Optimal Multiple-Query Nearest-Neighbor Algorithm on Meshes with Multiple Broadcasting (I Stoica)A Linear Algorithm for Segmentation of Digital Curves (I Debled-Rennesson & J-P Reveillès)Some Notes on Parallel Coordinate Grammars (A Nakamura)Basic Puzzle Languages (K G Subramanian et al.)Cooperating Systems of Three-Way Two-Dimensional Finite Automata (Y Wang et al.)The Effect of Inkdots for Two-Dimensional Automata (A Ito et al.)On Topology Preservation in 2-D and 3-D Thinning (T Y Kong)Two Methodologies to Implement 3D Thinning Algorithms on Distributed Memory Machines (V Marion-Poty)Analysis and Design of Parallel Thinning Algorithms — A Generic Approach (Y Y Zhang & P S P Wang)A New 26-Connected Objects Surface Tracking Algorithm and Its Related PRAM Version (L Perroton) Readership: Computer scientists. keywords:Parallilism;Digital Geometory;Mesh;Morphology;Array Grammar;Array Automata;Parallel Thinnning;Parallel Processing;Distributed Processing;Image Processing;Parallel Image Processing;Distributed Image Processing;Image Analysis;Parallel Image Analysis;Distributed Image Analysis
Categories: Computers

Algorithms and Computation

Algorithms and Computation

Some Properties of One-Pebble Turing Machines with Sublogarithmic Space Atsuyuki Inoue1, Akira Ito1, Katsushi Inoue1, and Tokio Okazaki2 1 Department of Computer Science and Systems Engineering, Faculty of Engineering, ...

Author: Toshihide Ibaraki

Publisher: Springer Science & Business Media

ISBN: 9783540206958

Category: Computers

Page: 748

View: 358

This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.
Categories: Computers

Mathematical Foundations of Computer Science 1995

Mathematical Foundations of Computer Science 1995

... Turing machines that accept nonregular languages . In Proc . of MFCS'95 , this volume , 1995 . [ 6 ] B. von Braunmühl , R. Gengler , and R. Rettinger . The alternation hierarchy for machines with sublogarithmic space is infinite .

Author: International Symposium on Mathematical Foundations of Computer Science (20 : 1995 : Praha)

Publisher: Springer Science & Business Media

ISBN: 3540602461

Category: Computers

Page: 588

View: 975

This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.
Categories: Computers

Developments in Language Theory

Developments in Language Theory

This paper shows a sublogarithmic space lower bound for two-dimensional probabilistic Turing machines (2-ptm's) over square tapes with bounded error, and shows, using this space lower bound theorem, that a specific set is not recognized ...

Author: Masami Ito

Publisher: Springer

ISBN: 9783540450054

Category: Mathematics

Page: 438

View: 871

The refereed proceedings of the 6th International Conference on Developments in Language Theory, DLT 2002, held in Kyoto, Japan in September 2002. The 28 revised full papers presented together with 8 invited papers were carefully reviewed and selected from 63 submissions. Among the topics addressed are grammars and acceptors for strings, graphs, arrays, etc; efficient algorithms for languages; combinatorial and algebraic properties of languages; decision problems; relations to complexity theory, logic picture description and analysis, DNA computing, cryptography, concurrency, quantum computing, and algebraic systems.
Categories: Mathematics

Automata 2008

Automata 2008

So, as a further restriction, we could consider realtime- IAs which are allowed to use only a sublogarithmic number of cells. Notice that an analogous investigation has been carried on even for space bounded Turing machines (see, e.g., ...

Author: Andrew Adamatzky

Publisher: Luniver Press

ISBN: 9781905986163

Category: Computers

Page: 616

View: 757

Cellular automata are regular uniform networks of locally-connected finite-state machines. They are discrete systems with non-trivial behaviour. Cellular automata are ubiquitous: they are mathematical models of computation and computer models of natural systems. The book presents results of cutting edge research in cellular-automata framework of digital physics and modelling of spatially extended non-linear systems; massive-parallel computing, language acceptance, and computability; reversibility of computation, graph-theoretic analysis and logic; chaos and undecidability; evolution, learning and cryptography. The book is unique because it brings together unequalled expertise of inter-disciplinary studies at the edge of mathematics, computer science, engineering, physics and biology.
Categories: Computers

Complexity Theory

Complexity Theory

have not worked for sublogarithmic space , and it has not been clear whether various central properties of larger - space ... the set of all languages that can be recognized by S - space - bounded deterministic Turing machines ( DTM ) .

Author: Lane A. Hemaspaandra

Publisher: Springer Science & Business Media

ISBN: 0387949739

Category: Computers

Page: 339

View: 933

This volume provides a survey of the subject in the form of a collection of articles written by experts, that together provides a comprehensive guide to research. The editors'aim has been to provide an accessible description of the current stae of complexity theory, and to demonstrate the breadth of techniques and results that make this subject so exciting. Thus, papers run the gamut from sublogarithmic space to exponential time, and from new combinatorial techniques to interactive proof systems.
Categories: Computers

SOFSEM 98 Theory and Practice of Informatics

SOFSEM  98  Theory and Practice of Informatics

Turing machines with sublogarithmic space differ sharply from those which have logarithmic or greater space. If the function L(n) is not fully space constructible, it is possible that a language A is weakly L(n) space recognizable while ...

Author: Branislav Rovan

Publisher: Springer

ISBN: 9783540494775

Category: Computers

Page: 460

View: 943

This book constitutes the proceedings of the 25th Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'98, held in Jasna, Slovakia, in November 1998. The volume presents 19 invited survey articles by internationally well-known authorities together with 18 revised full research papers carefully reviewed and selected for inclusion in the book. The areas covered include history of models of computation, algorithms, formal methods, practical aspects of software engineering, database systems, parallel and distributed systems, electronic commerce, and electronic documents and digital libraries.
Categories: Computers

SOFSEM 2009 Theory and Practice of Computer Science

SOFSEM 2009  Theory and Practice of Computer Science

Bertoni, A., Mereghetti, C., Pighizzini, G.: Strong optimal lower bounds for Turing machines that accept nonregular languages. ... Geffert, V.: Nondeterministic computations in sublogarithmic space and space constructibility.

Author: Mogens Nielsen

Publisher: Springer

ISBN: 9783540958918

Category: Computers

Page: 670

View: 819

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in Špindleruv Mlýn, Czech Republic, in January 2009. The 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. SOFSEM 2009 was organized around the following four tracks: Foundations of Computer Science; Theory and Practice of Software Services; Game Theoretic Aspects of E-commerce; and Techniques and Tools for Formal Verification.
Categories: Computers

STACS 93

STACS 93

... B. von , Alternationshierarchien von Turingmaschinen mit kleinem Speicher , habilitation thesis , Bonn , Juni 1991 . [ Bra93 ] Braunmühl , B. von , Alternation for two - way machines with sublogarithmic space , this volume .

Author: Patrice Enjalbert

Publisher: Springer Science & Business Media

ISBN: 3540565035

Category: Computers

Page: 723

View: 584

This volume contains the proceedings of the tenth annual Symposium on Theoretical Aspects of Computer Science (STACS '93), held in W}rzburg, February 25-27, 1993. The STACS symposia are held alternately in Germany and France, and organized jointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI) and theSpecial Interest Group for Applied Mathematics of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (afcet). The volume includes the three invited talks which opened the three days of the symposium: "Causal and distributed semantics for concurrent processes" (I. Castellani), "Parallel architectures: design and efficient use" (B. Monien et al.), and "Transparent proofs" (L. Babai). The selection of contributed papers is organized into parts on: computational complexity, logic in computer science, efficient algorithms, parallel and distributed computation, language theory, computational geometry, automata theory, semantics and logic of programming languages, automata theory and logic, circuit complexity, omega-automata, non-classical complexity, learning theory and cryptography, and systems.
Categories: Computers

Programming Languages and Systems

Programming Languages and Systems

In this way, we can consider each Offline Turing Machine as a normal Turing Machine with the special input/output ... We will not consider OTMs with sublogarithmic space usage here and indeed 'Classes of languages accepted within ...

Author: Andrew Gordon

Publisher: Springer Science & Business Media

ISBN: 9783642119569

Category: Computers

Page: 632

View: 882

This book constitutes the refereed proceedings of the 19th European Symposium on Programming, ESOP 2010, held in Paphos, Cyprus, in March 2010, as part of ETAPS 2010, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers, presented together with two invited talks (one abstract and one full), were carefully reviewed and selected from 121 full paper submissions. The topics addressed include programming paradigms and styles, methods and tools to write and specify programs and languages, methods and tools for reasoning about programs, methods and tools for implementation, and concurrency and distribution.
Categories: Computers

STACS 97

STACS 97

cannot be recognized by a sublogarithmic space - bounded probabilistic Turing machine with any error probability € < 1/2 . On the other hand , there exists a constant - space - bounded interactive proof system ( with public coin flips ) ...

Author: Rüdiger Reischuk

Publisher: Springer Science & Business Media

ISBN: 3540626166

Category: Computers

Page: 614

View: 585

This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.
Categories: Computers

Mathematical Foundations of Computer Science 2001

Mathematical Foundations of Computer Science 2001

26 (1988) 279–84. 388, 396 Szepietowski,A.: Turing Machines with Sublogarithmic Space. Springer-Verlag, Lect. Notes Comput. Sci. 843 (1994). 389, 396 ˇZák, S.: A Turing machine time hierarchy. Theoret. Comput. Sci. 26 (1983) 327–33.

Author: Ales Pultr

Publisher: Springer Science & Business Media

ISBN: 9783540424963

Category: Computers

Page: 716

View: 102

This book constitutes the refereed proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001, held in Marianske Lazne, Czech Republic in August 2001. The 51 revised full papers presented together with 10 invited contributions were carefully reviewed and selected from a total of 118 submissions. All current aspects of theoretical computer science are addressed ranging from mathematical logic and programming theory to algorithms, discrete mathematics, and complexity theory. Besides classical issues, modern topics like quantum computing are discussed as well.
Categories: Computers

Mathematical Foundations of Computer Science 2001

Mathematical Foundations of Computer Science 2001

26 (1988) 279–84. 388, 396 Szepietowski,A.: Turing Machines with Sublogarithmic Space. Springer-Verlag, Lect. Notes Comput. Sci. 843 (1994). 389, 396 ˇZák, S.: A Turing machine time hierarchy. Theoret. Comput. Sci. 26 (1983) 327–33.

Author: Jiri Sgall

Publisher: Springer

ISBN: 9783540446835

Category: Computers

Page: 718

View: 676

This book constitutes the refereed proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001, held in Marianske Lazne, Czech Republic in August 2001. The 51 revised full papers presented together with 10 invited contributions were carefully reviewed and selected from a total of 118 submissions. All current aspects of theoretical computer science are addressed ranging from mathematical logic and programming theory to algorithms, discrete mathematics, and complexity theory. Besides classical issues, modern topics like quantum computing are discussed as well.
Categories: Computers

Computer Science Theory and Applications

Computer Science     Theory and Applications

Dietz, P., Macarie, I., Seiferas, J.: Bits and relative order from residues, space efficiently. ... Emde Boas, P.: Machine models and simulations. ... 4, 177–192 (1970) Szepietowski, A.: Turing Machines with Sublogarithmic Space.

Author: Pascal Weil

Publisher: Springer

ISBN: 9783319587479

Category: Computers

Page: 337

View: 483

This book constitutes the proceedings of the 12th International Computer Science Symposium in Russia, CSR 2017, held in Kazan, Russia, in June 2017. The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems, networks; applications of logic to computer science, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing.
Categories: Computers

Formal Models Languages and Applications

Formal Models  Languages and Applications

A. Szepietowski, “Turing machines with sublogarithmic space”, Lecture Notes in Computer Science 843, 1994. CHAPTER 12 VERIFICATION OF CLOCK SYNCHRONIZATION IN TTP K. Kalyanasundaram Sublogarithmically Space-Bounded Alternating ...

Author: Madhavan Mukund

Publisher: World Scientific

ISBN: 9789812773036

Category: Language Arts & Disciplines

Page: 410

View: 124

A collection of articles by leading experts in theoretical computer science, this volume commemorates the 75th birthday of Professor Rani Siromoney, one of the pioneers in the field in India. The articles span the vast range of areas that Professor Siromoney has worked in or influenced, including grammar systems, picture languages and new models of computation. Sample Chapter(s). Chapter 1: Finite Array Automata and Regular Array Grammars (150 KB). Contents: Finite Array Automata and Regular Array Grammars (A Atanasiu et al.); Hexagonal Contextual Array P Systems (K S Dersanambika et al.); Contextual Array Grammars (R Freund et al.); A Cosmic Muse (T Head); Triangular Pasting System (T Kalyani et al.); Petri Nets, Event Structures and Algebra (K Lodaya); Anchored Concatenation of MSCs (M Mukund et al.); On Languages Defined by Numerical Parameters (A Salomaa); Digitalization of Kolam Patterns and Tactile Kolam Tools (S Nagata & R Thamburaj); Pollard''s Rho Split Knowledge Scheme (M K Viswanath & K P Vidya); and other papers. Readership: Researchers in computer science.
Categories: Language Arts & Disciplines

Mathematical Foundations of Computer Science 1997

Mathematical Foundations of Computer Science 1997

Several authors , Geffert , von Braunmühl / Gengler / Rettinger , and we have shown that the space hierarchy defined by such alternating machines is infinite [ BGR93 , Ge94 , LiRe93 , LiRe96a ] : E1 Space ( SUBLOG ) C E2Space ( SUBLOG ) ...

Author: Igor Privara

Publisher: Springer Science & Business Media

ISBN: 3540634371

Category: Computers

Page: 517

View: 162

This book constitutes the refereed post-conference proceedings of the Second International Andrei Ershov Memorial Conference on System Informatics, held in Akademgorodok, Novosibirsk, Russia, in June 1996. The 27 revised full papers presented together with 9 invited contributions were thoroughly refereed for inclusion in this volume. The book is divided in topical sections on programming methodology, artificial intelligence, natural language processing, machine learning, dataflow and concurrency models, parallel programming, supercompilation, partial evaluation, object-oriented programming, semantics and abstract interpretation, programming and graphical interfaces, and logic programming.
Categories: Computers

Developments in Language Theory

Developments in Language Theory

Freivalds, R.: Space and reversal complexity of probabilistic one-way Turing machines. ... International Journal of Foundations of Computer Science 18(6), 1383–1394 (2007) Szepietowski, A.: Turing Machines with Sublogarithmic Space.

Author: Arseny M. Shur

Publisher: Springer

ISBN: 9783319096988

Category: Computers

Page: 349

View: 495

This book constitutes the proceedings of the 18th International Conference on Developments in Language Theory, DLT 2014, held in Ekaterinburg, Russia, in August 2014. The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on Grammars, Acceptors and Transducers for Words, Trees and Graphs, Algebraic Theories of Automata, Algorithmic, Combinatorial and Algebraic Properties of Words and Languages, Variable Length Codes, Symbolic Dynamics, Cellular Automata, Polyominoes and Multidimensional Patterns, Decidability Questions, Image Manipulation and Compression, Efficient Text Algorithms, Relationships to Cryptography, Concurrency, Complexity Theory and Logic, Bio-Inspired Computing and Quantum Computing.
Categories: Computers

Language and Automata Theory and Applications

Language and Automata Theory and Applications

Springer, Heidelberg (1977) Pighizzini, G.: Nondeterministic one-tape off-line Turing machines. J. Automata, Lang. Combinatorics 14(1), 107–124 ... (1965) Szepietowski, A.: Turing Machines with Sublogarithmic Space. LNCS, vol. 843.

Author: Adrian-Horia Dediu

Publisher: Springer

ISBN: 9783319300009

Category: Computers

Page: 618

View: 940

This book constitutes the refereed proceedings of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016, held in Prague, Czech Republic, in March 2016. The 42 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 119 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
Categories: Computers