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=231
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
LANGAGE: A maple package for automaton characterization of regular languages
Pascal Caron
Theoretical Computer Science
231
(1), 2000, pp. 5-15
The design principles of a weighted finite-state transducer library
Mehryar Mohri
,
Fernando Pereira
,
Michael Riley
Theoretical Computer Science
231
(1), 2000, pp. 17-32
INTEX: An FST toolbox
Max Solberztein
Theoretical Computer Science
231
(1), 2000, pp. 33-46
Minimal separating sets for acceptance conditions in Muller automata
Helmut Lescow
,
Jens Vöge
Theoretical Computer Science
231
(1), 2000, pp. 47-57
Optimal estimation on the order of local testability of finite automata
A.N. Trahtman
Theoretical Computer Science
231
(1), 2000, pp. 59-74
Sorting and doubling techniques for set partitioning and automata minimization problems
D. Ziadi
Theoretical Computer Science
231
(1), 2000, pp. 75-87
An efficient null-free procedure for deciding regular language membership
J.-L. Ponty
Theoretical Computer Science
231
(1), 2000, pp. 89-101
Efficient implementation of regular languages using reversed alternating finite automata
K. Salomaa
,
X. Wu
,
S. Yu
Theoretical Computer Science
231
(1), 2000, pp. 103-111
Automata of asynchronous behaviors
J.A. Brzozowski
,
R. Negulescu
Theoretical Computer Science
231
(1), 2000, pp. 113-128
Pseudo-minimal transducer
Denis Maurel
Theoretical Computer Science
231
(1), 2000, pp. 129-139
The Turing closure of an Archimedean field
Paolo Boldi
,
Sebastiano Vigna
Theoretical Computer Science
231
(2), 2000, pp. 143-156
On the universality of Post and splicing systems
C. Ferretti
,
G. Mauri
,
S. Kobayashi
,
T. Yokomori
Theoretical Computer Science
231
(2), 2000, pp. 157-170
Nine test tubes generate any RE language
C. Ferretti
,
G. Mauri
,
C. Zandron
Theoretical Computer Science
231
(2), 2000, pp. 171-180
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
Katsunobu Imai
,
Kenichi Morita
Theoretical Computer Science
231
(2), 2000, pp. 181-191
Using DNA to solve the bounded Post correspondence problem
Lila Kari
,
Greg Gloor
,
Sheng Yu
Theoretical Computer Science
231
(2), 2000, pp. 193-203
More on morphisms and almost-periodicity
Arnaud Maes
Theoretical Computer Science
231
(2), 2000, pp. 205-215
Frontier between decidability and undecidability: A survey
Maurice Margenstern
Theoretical Computer Science
231
(2), 2000, pp. 217-251
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
C. Michaux
,
C. Troestler
Theoretical Computer Science
231
(2), 2000, pp. 253-273
DNA computing based on splicing: Universality results
Gheorghe Păun
Theoretical Computer Science
231
(2), 2000, pp. 275-296
Intractability of decision problems for finite-memory automata
Hiroshi Sakamoto
,
Daisuke Ikeda
Theoretical Computer Science
231
(2), 2000, pp. 297-308
Complete formal systems for equivalence problems
Géraud Sénizergues
Theoretical Computer Science
231
(2), 2000, pp. 309-334