Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characterization of state-independent automata
J.W. Grzymala-Busse
,
Z. Bavel
Theoretical Computer Science
43
(1), 1986, May, pp. 1-10
Decomposition of linear automata over residue rings into shift-registers
A. Scheuing
Theoretical Computer Science
43
(1), 1986, May, pp. 11-30
A topological characterization of thinning
C. Ronse
Theoretical Computer Science
43
(1), 1986, May, pp. 31-41
On the construction of parallel computers from various bases of Boolean functions
Leslie M. Goldschlager
,
Ian Parberry
Theoretical Computer Science
43
(1), 1986, May, pp. 43-58
Infinite-word languages and continuous mappings
R.R. Redziejowski
Theoretical Computer Science
43
(1), 1986, May, pp. 59-79
Semantic analysis of inductive reasoning
E. OrĘowska
Theoretical Computer Science
43
(1), 1986, May, pp. 81-89
The demonstration of a simple proof of Skolem-Mahler-Lech theorem
G. Hansel
Theoretical Computer Science
43
(1), 1986, May, pp. 91-98
On the finite containment problem for Petri nets
P. Clote
Theoretical Computer Science
43
(1), 1986, May, pp. 99-105
Alternation and
\omega
-type Turing acceptors
P.A. Lindsay
Theoretical Computer Science
43
(1), 1986, May, pp. 107-115
Test sets for finite substitutions
M.H. Albert
,
J. Lawrence
Theoretical Computer Science
43
(1), 1986, May, pp. 117-122
Relational algebraic semantics of deterministic and nondeterministic programs
R. Berghammer
,
H. Zierer
Theoretical Computer Science
43
(2-3), 1986, pp. 123-147
Partial evaluation and
\omega
-completeness of algebraic specifications
J. Heering
Theoretical Computer Science
43
(2-3), 1986, pp. 149-167
Random generation of combinatorial structures from a uniform distribution
Mark R. Jerrum
,
Leslie G. Valiant
,
Vijay V. Vazirani
Theoretical Computer Science
43
(2-3), 1986, pp. 169-188
Complete sets of unifiers and matchers in equational theories
F. Fages
,
G. Huet
Theoretical Computer Science
43
(2-3), 1986, pp. 189-200
More on the complexity of slice functions
I. Wegener
Theoretical Computer Science
43
(2-3), 1986, pp. 201-211
Concurrent and maximally concurrent evolution of nonsequential systems
R. Janicki
,
P.E. Lauer
,
M. Koutny
,
R. Devillers
Theoretical Computer Science
43
(2-3), 1986, pp. 213-238
Efficient string matching with
k
mismatches
G.M. Landau
,
U. Vishkin
Theoretical Computer Science
43
(2-3), 1986, pp. 239-249
Scott induction and closure under
\omega
-sups
A. Pasztor
,
R. Statman
Theoretical Computer Science
43
(2-3), 1986, pp. 251-263
Star-free sets of integers
A. de Luca
,
A. Restivo
Theoretical Computer Science
43
(2-3), 1986, pp. 265-275
Specification and verification of decentralized daisy chain arbiters with
\omega
-extended regular expressions
I. Suzuki
,
Y. Motohashi
,
K. Taniguchi
,
T. Kasami
,
T. Okamoto
Theoretical Computer Science
43
(2-3), 1986, pp. 277-291
Continuous semilattices
J. Adamek
,
J. Reiterman
,
E. Nelson
Theoretical Computer Science
43
(2-3), 1986, pp. 293-313
Varieties of automata deriving from infinite trees
A. Saoudi
Theoretical Computer Science
43
(2-3), 1986, pp. 315-335
The complexity of colouring problems on dense graphs
K. Edwards
Theoretical Computer Science
43
(2-3), 1986, pp. 337-343
A simple proof of a time-space trade-off for sorting with linear comparisons
D.B. Johnson
Theoretical Computer Science
43
(2-3), 1986, pp. 345-350