Sur les varietes de langages et de monoïdes (English)
National licence
- New search for: Reutenauer, Christophe
- New search for: Reutenauer, Christophe
In:
Theoretical Computer Science 4th GI Conference
;
260-265
;
1979
-
ISBN:
- Article/Chapter (Book) / Electronic Resource
-
Title:Sur les varietes de langages et de monoïdes
-
Contributors:Reutenauer, Christophe ( author )
-
Published in:Lecture Notes in Computer Science ; 67 ; 260-265
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1979-01-01
-
Size:6 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Context-free sets of infinite wordsBoasson, L. et al. | 1979
- 10
-
New aspects of homomorphismsMaurer, H. et al. | 1979
- 25
-
Can partial correctness assertions specify programming language semantics?Greif, Irene / Meyer, Albert R. et al. | 1979
- 27
-
An algebraic theory for synchronizationMilner, R. et al. | 1979
- 36
-
Storage modification machinesSchönhage, A. et al. | 1979
- 38
-
Negative results on countingValiant, L. G. et al. | 1979
- 47
-
Strong non-deterministic context-free languagesBeauquier, Joffroy et al. | 1979
- 58
-
Information content characterizations of complexity theoretic propertiesBennison, Victor L. et al. | 1979
- 67
-
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten BäumenBlum, Norbert / Mehlhorn, Kurt et al. | 1979
- 79
-
A new recursion induction principleBoudol, Gerard et al. | 1979
- 91
-
Finite-change automataBraunmühl, Burchard / Verbeek, Rutger et al. | 1979
- 101
-
Move rules and trade-offs in the pebble gameEmde Boas, Peter / Leeuwen, Jan et al. | 1979
- 113
-
Transition diagrams and strict deterministic grammarsFriede, Dietmar et al. | 1979
- 124
-
Exact expressions for some randomness testsGács, Péter et al. | 1979
- 132
-
On storage optimization for automatically generated compilersGanzinger, Harald et al. | 1979
- 142
-
On continuous completionsGuessarian, Irène et al. | 1979
- 153
-
A new method to show lower bounds for polynomials which are hard to computeHeintz, Joos et al. | 1979
- 158
-
On zerotesting-bounded multicounter machinesJantzen, Matthias et al. | 1979
- 170
-
When are two effectively given domains identical?Kanda, Akira / Park, David et al. | 1979
- 182
-
Sur deux langages linéairesLatteux, M. et al. | 1979
- 190
-
An efficient on-line position tree construction algorithmMajster, M. / Reiser, A. et al. | 1979
- 199
-
Sorting presorted filesMehlhorn, Kurt et al. | 1979
- 213
-
Node-visit optimal 1 – 2 brother treesOttmann, Th. / Rosenberg, A. L. / Six, H. W. / Wood, D. et al. | 1979
- 222
-
A graph theoretic approach to determinism versus non-determinismPaul, W. J. / Reischuk, R. et al. | 1979
- 233
-
Une caracterisation de trois varietes de langages bien connuesPin, J. E. et al. | 1979
- 244
-
Über eine minimale universelle Turing-MaschinePriese, Lutz et al. | 1979
- 260
-
Sur les varietes de langages et de monoïdesReutenauer, Christophe et al. | 1979
- 266
-
Automaten in planaren graphenRollik, H. A. et al. | 1979
- 276
-
Theoreme de transversale rationnelle pour les automates a pile deterministesSakarovitch, Jacques et al. | 1979
- 286
-
On the additive complexity of polynomials and some new lower boundsSchnorr, C. P. et al. | 1979
- 298
-
Remarks on the nonexistence of some covering grammarsUkkonen, Esko et al. | 1979
- 310
-
Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher ProgrammeWöhl, Kai et al. | 1979