default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 46
Volume 46, 1986
- Christian Mauduit
:
Morphismes Unispectraux. 1-11 - Gilles Bernot, Michel Bidoit, Christine Choppy:
Abstract Data Types with Exception Handling: An Initial Approach Based on a Distinction Between Exceptions and Errors. 13-45 - Y. Q. Guo, G. W. Xu, Gabriel Thierrin:
Disjunctive Decomposition of Languages. 47-51 - Kosaburo Hashiguchi:
Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages. 53-66 - Nadine Lerat, Witold Lipski Jr.:
Nonapplicable Nulls. 67-82 - Tom Head, Barbara Lando:
Periodic D0L Languages. 83-89 - Hideki Yamasaki, Masako Takahashi, Kojiro Kobayashi:
Characterization of omega-Regular Languages by Monadic Second-Order Formulas. 91-99 - Michel Latteux, Erick Timmerman:
Two Characterizations of Rational Adherences. 101-106 - Rodney R. Howell, Louis E. Rosier, Dung T. Huynh, Hsu-Chun Yen:
Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States. 107-140 - Joxan Jaffar, Peter J. Stuckey:
Semantics of Infinite Tree Logic Programming. 141-158 - Christine Duboc:
On Some Equations in Free Partially Commutative Monoids. 159-174 - Alvis Brazma, Efim B. Kinber:
Generalized Regular Expressions-A Language for Synthesis of Programs with Braching in Loops. 175-195 - Giuseppe Longo, Simone Martini:
Computability in Higher Types, P omega and the Completeness of Type Assignment. 197-217 - Phan Dinh Dieu, Le Cong Thanh, Lê Tuân Hoa:
Average Polynomial Time Complexity of Some NP-Complete Problems. 219-237 - Petr Hájek:
A simple dynamic logic. 239-259 - Chua-Huang Huang, Christian Lengauer:
The automated proof of a trace transformation for a bitonic sort. 261-284 - Anne Dicky:
An algebraic and algorithmic method for analysing transition systems. 285-303 - Thérèse Hardin, Alain Laville:
Proof of termination of the rewriting system subst on CCL. 305-312 - Volker Diekert:
On some variants of the Ehrenfeucht conjecture. 313-318 - Volker Diekert:
Commutative monoids have complete presentations by free (non-commutative) monoids. 319-327 - Bernhard Griesser:
Lower Bounds for the Approximative Complexity. 329-338
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 2025-02-19 00:33 CET 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:
