Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 Proceedings > Alternating and Empty Alternating Auxiliary Stack Automata
Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 Proceedings |
Mogens Nielsen; Branislav Rovan
Springer Berlin Heidelberg
Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 Proceedings
Alternating and Empty Alternating Auxiliary Stack Automata
Authors

Markus Holzer; Pierre McKenzie

ARI Id

1664830438902_3694057

Access

Not Available Free

Pages

415-425

DOI

10.1007/3-540-44612-5_37

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-44612-5_37

Table of Contents of Book
Showing 1 to 20 of 67 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XIII
Region Analysis and a π-Calculus with Groups
Silvano Dal Zilio; Andrew D. Gordon
1-20
Abstract Data Types in Computer Algebra
James H. Davenport
21-35
What Do We Learn from Experimental Algorithmics?
Camil Demetrescu; Giuseppe F. Italiano
36-51
And/Or Hierarchies and Round Abstraction
1Radu Grosu
52-63
Computational Politics: Electoral Systems
Edith Hemaspaandra; Lane A. Hemaspaandra
64-83
0–1 Laws for Fragments of Existential Second-Order Logic: A Survey
Phokion G. Kolaitis; Moshe Y. Vardi
84-98
On Algorithms and Interaction
Jan van Leeuwen; Jiří Wiedermann
99-113
On the Use of Duality and Geometry in Layouts for ATM Networks
Shmuel Zaks
114-131
On the Lower Bounds for One-Way Quantum Automata
Farid Ablayev; Aida Gainutdinova
132-140
Axiomatizing Fully Complete Models for ML Polymorphic Types
Samson Abramsky; Marina Lenisa
141-151
Measure Theoretic Completeness Notions for the Exponential Time Classes
Klaus Ambos-Spies
152-161
Edge-Bisection of Chordal Rings
Lali Barriére; Josep Fábrega
162-171
Equation Satisfiability and Program Satisfiability for Finite Monoids
David Mix Barrington; Pierre McKenzie; Cris Moore; Pascal Tesson; Denis Thérien
172-181
XML Grammars
Jean Berstel; Luc Boasson
182-191
Simplifying Flow Networks
Therese C. Biedl; Broňa Brejová; Tomáš Vinař
192-201
Balanced k-Colorings
Therese C. Biedl; Eowyn Cenek; Timothy M. Chan; Erik D. Demaine; Martin L. Demaine; Rudolf Fleischer et al.
202-211
A Compositional Model for Confluent Dynamic Data-Flow Networks
Frank S. de Boer; Marcello M. Bonsangue
212-221
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Beate Bollig
222-231
Expressiveness of Updatable Timed Automata
P. Bouyer; C. Dufourd; E. Fleury; A. Petit
232-242
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 67 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings