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=134
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Semiretracts of a free monoid
J.A. Anderson
Theoretical Computer Science
134
(1), 1994, pp. 3-11
Rabin tree automata and finite monoids
Danièle Beauquier
,
Andreas Podelski
Theoretical Computer Science
134
(1), 1994, pp. 13-25
A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
Agnès Bonnier-Rigny
,
Daniel Krob
Theoretical Computer Science
134
(1), 1994, pp. 27-50
Boolean neural nets are observable
Fernando Botelho
,
Max Garzon
Theoretical Computer Science
134
(1), 1994, pp. 51-61
A fast algorithm for the unique decipherability of multivalued encodings
Renato M. Capocelli
,
Luisa Gargano
,
Ugo Vaccaro
Theoretical Computer Science
134
(1), 1994, pp. 63-78
On dynamic algebras
Sinis̑a Crvenković
,
Rozália Sz. Madarász
Theoretical Computer Science
134
(1), 1994, pp. 79-86
A partial trace semantics for Petri nets
V. Diekert
Theoretical Computer Science
134
(1), 1994, pp. 87-105
Transducers and the decidability of independence in free monoids
H. Jürgensen
,
K. Salomaa
,
S. Yu
Theoretical Computer Science
134
(1), 1994, pp. 107-117
Languages of colonies
Alica Kelemenová
,
Erzsébet Csuhaj-Varjú
Theoretical Computer Science
134
(1), 1994, pp. 119-130
An introduction to commutative and noncommutative Gröbner bases
Teo Mora
Theoretical Computer Science
134
(1), 1994, pp. 131-173
Codes modulo finite monadic string-rewriting systems
Friedrich Otto
,
Paliath Narendran
Theoretical Computer Science
134
(1), 1994, pp. 175-188
Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
Norman R. Reilly
Theoretical Computer Science
134
(1), 1994, pp. 189-208
A bijection between cliques in graphs and factorizations in free monoids
J.-C. Spehner
Theoretical Computer Science
134
(1), 1994, pp. 209-223
Finite-valued distance automata
Andreas Weber
Theoretical Computer Science
134
(1), 1994, pp. 225-251
Exponential upper and lower bounds for the order of a regular language
Andreas Weber
Theoretical Computer Science
134
(1), 1994, pp. 253-262
Locating P/poly optimally in the extended low hierarchy
J. Köbler
Theoretical Computer Science
134
(2), 1994, pp. 263-285
Testing satisfiability of a class of object-oriented conjunctive queries
Edward P.F. Chan
Theoretical Computer Science
134
(2), 1994, pp. 287-309
Undecidable properties of deterministic top-down tree transducers
Z. Fülöp
Theoretical Computer Science
134
(2), 1994, pp. 311-328
Finite-memory automata
Michael Kaminski
,
Nissim Francez
Theoretical Computer Science
134
(2), 1994, pp. 329-363
Some decision problems for parallel communicating grammar systems
Ferucio Laurentiu Tiplea
,
Cristian Ene
,
Cecilia Magdalena Ionescu
,
Octavian Procopiuc
Theoretical Computer Science
134
(2), 1994, pp. 365-385
Inversion of 2D cellular automata: Some complexity results
B. Durand
Theoretical Computer Science
134
(2), 1994, pp. 387-401
Representation of rational functions with prefix and suffix codings
T. Harju
,
H.C.M. Kleijn
,
M. Latteux
,
A. Terlutte
Theoretical Computer Science
134
(2), 1994, pp. 403-413
On the tiling of a torus with two bars
Eric Remila
Theoretical Computer Science
134
(2), 1994, pp. 415-426
Speedup of determinism by alternation for multidimensional Turing machines
Louis Mak
Theoretical Computer Science
134
(2), 1994, pp. 427-453
Stochastic independence, algebraic independence and abstract connectedness
Frantis̑ek Matús̑
Theoretical Computer Science
134
(2), 1994, pp. 455-471
Seiten 1
2
>