Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (36 papers)
-
Front Matter
Keywords
- Factor
- NP
- Notation
- algorithms
- automata
- compiler
- complexity
- derivation
- grammars
- logic
- petri net
- semantics
- sorting
- algorithm analysis and problem complexity
Bibliographic Information
Book Title: STACS 85
Book Subtitle: 2nd Annual Symposium on Theoretical Aspects of Computer Science, Saarbrücken, January 3-5, 1985
Editors: K. Mehlhorn
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0023988
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1985
Softcover ISBN: 978-3-540-13912-6Published: 01 December 1984
eBook ISBN: 978-3-540-39136-4Published: 19 November 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VII, 375
Topics: Algorithms, Formal Languages and Automata Theory, Theory of Computation, Models of Computation