Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th ICALP 1977: Turku, Finland
- Arto Salomaa, Magnus Steinby:
Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings. Lecture Notes in Computer Science 52, Springer 1977, ISBN 3-540-08342-1 - Alfred V. Aho, Ravi Sethi:
How Hard is Compiler Code Generation? 1-15 - Donald A. Alton:
"Natural" Complexity Measures and Time versus Memory: Some Definitional Proposals. 16-29 - Krzysztof R. Apt, J. W. de Bakker:
Semantics and Proof Theory of Pascal Procedures. 30-44 - Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
On the Structure of Combinatorial Problems and Structure Preserving Reductions. 45-60 - Roland Carl Backhouse
, R. K. Lutz:
Factor Graphs, Failure Functions and BI-Trees. 61-75 - David B. Benson, Ralph D. Jeffords:
Parallel Decomposition of LR(k) Parsers (Extended Abstract). 76-86 - Alberto Bertoni, Giancarlo Mauri, Mauro Torelli:
Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata. 87-94 - Corrado Böhm, Mario Coppo, Mariangiola Dezani-Ciancaglini:
Termination Tests inside lambda-Calculus. 95-110 - Ronald V. Book, Chee-Keng Yap:
On the Computational Power of Reversal-Bounded Machines. 111-119 - Franz-Josef Brandenburg:
The Contextsensitivity Bounds of Contextsensitive Grammars and Languages. 120-134 - Michal Chytil, Vojtech Jákl:
Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings. 135-147 - Karel Culík II, Ivan Fris:
The Sequence Equivalence Problem for D0L Systems is Decidable. 148-163 - Werner Damm:
Languages Defined by Higher Type Program Schemes. 164-179 - Ernst-Wolfgang Dieterich:
Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures. 180-192 - Alexander Ja. Dikovsky, Larisa S. Modina:
On Three Types of Unambiguity of Context-Free Languages. 193-205 - Hartmut Ehrig, Barry K. Rosen:
The Mathematics of Record Handling. 206-220 - Joost Engelfriet:
Macro Grammars, Lindenmayer Systems and Other Copying Devices. 221-229 - Wilhelm J. Erni:
On the Time and Tape Complexity of Hyper(1)-AFL's. 230-243 - Matthias Höpner, Manfred Opp:
Renaming and Erasing in Szilard Languages. 244-257 - Alon Itai, Michael Rodeh:
Some Matching Problems. 258-268 - Gérard Jacob:
Complexite des Demi-Groupes de Matrices. 269-281 - Theo M. V. Janssen, Peter van Emde Boas:
On the Proper Treatment or Referencing, Dereferencing and Assignment. 282-300 - Neil D. Jones, Sven Skyum:
Complexity of Some Problems Concerning L Systems. 301-308 - Hans-Peter Kriegel, Thomas Ottmann:
Left-Fitting Translations. 309-322 - Kurt Mehlhorn:
Dynamic Binary Search. 323-336 - Burkhard Monien:
About the Derivation Languages of Grammars and Machines. 337-351 - Anton Nijholt:
Simple Chain Grammars. 352-364 - Wolfgang J. Paul, Robert Endre Tarjan:
Time-Space Trade-Offs in a Pebble Game. 365-369 - Azaria Paz, Shlomo Moran:
Non-Deterministic Polynomial Optimization Problems and Their Approximation. 370-379 - Amir Pnueli, Giora Slutzki:
Simple Programs and Their Decision Problems. 380-390 - Václav Rajlich:
Theory of Data Structures by Relational and Graph Grammars. 391-411 - Willem P. de Roever:
On Backtracking and Greatest Fixpoints. 412-429 - Grzegorz Rozenberg, Dirk Vermeir:
L Systems of Finite Index (Extended Abstract). 430-439 - Jorma Sajaniemi:
The Safety of a Coroutine System. 440-452 - Walter J. Savitch, Paul M. B. Vitányi:
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps. 453-464 - Adi Shamir, William W. Wadge:
Data Types as Objects. 465-479 - Janos Simon:
On the Difference Between One and Many (Preliminary Version). 480-491 - Seppo Sippu, Eljas Soisalon-Soininen:
On Defining Error Recovery in Context-Free Parsing. 492-503 - Ileana Streinu:
LL(k) Languages are Closed Under Union with Finite Languages. 504-508 - Ivan Hal Sudborough:
The Time and Tape Complexity of Developmental Languages. 509-523 - Masako Takahashi:
Rational relations of Binary Trees. 524-538 - Hermann K.-G. Walter:
Structural Equivalence of Context-Free Grammar Forms is Decidable. 539-553 - Bruno Courcelle:
On the Definition of Classes of Interpretations. 554-569
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
