Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Systems Theory, Volume 13
Volume 13, 1979
- Laurian M. Chirica, David F. Martin:
An Order-Algebraic Definition of Knuthian Semantics. 1-27 - Neil D. Jones, Sven Skyum:
Complexity of Some Problems Concerning L Systems. 29-43 - Harry R. Lewis:
Satisfiability Problems for Propositional Calculi. 45-53 - Alan L. Selman:
P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. 55-65 - Prodip Sen, M. R. Chidambara:
Dolezals's Theorem Revisited. 67-79 - Masakazu Nasu:
Indecomposable Local Maps of Tesselation Automata. 81-93 - Richard A. DeMillo, Richard J. Lipton:
A Constructive Generalization of the Borel-Cantelli Lemma with Application to the Complexity of Infinite Strings. 95-104 - Arnold L. Rosenberg, Derick Wood, Zvi Galil:
Storage Representations for Tree-Like Data Structures. 105-130 - Bruno Courcelle:
Infinite Trees in Normal Form and Recursive Equations Having a Unique Solution. 131-180 - Oscar H. Ibarra:
Restricted One-Counter Machines with Undecidable Universe Problems. 181-186
Volume 13, 1980
- Nancy A. Lynch, Edward K. Blum:
Relative Complexity of Operations on Numeric and Bit-String Algebras. 187-207 - Jean H. Gallier:
On The Existence of Optimal Fixpoints. 209-217 - André Arnold, Maurice Nivat:
Formal Computations of Non Deterministic Recursive Program Schemes. 219-236 - William A. Porter:
Multiple Signal Extraction by Polynomial Filtering. 237-254 - Evelyn Nelson:
Categorical and Topological Aspects of Formal Languages. 255-273 - André Arnold:
Le Théorème de Transversale Rationnelle dans les Langages d'Arbres. 275-282 - Dana Angluin:
On Relativizing Auxiliary Pushdown Machines. 283-299 - Eli Shamir, Marc Snir:
On the Depth Complexity of Formulas. 301-322 - Eljas Soisalon-Soininen:
On Comparing LL(k) and LR(k) Grammars. 323-329 - F. Rodriguez:
Compelled Operations and Operations of Degree P. 331-347 - Mark Luker:
Control Sets on Grammars Using Depth-First Derivations. 349-359 - L. R. Hunt:
Global Controllability of Nonlinear Systems in Two Dimensions. 361-376
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 21:15 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:
