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
[2]
Hilfe
Suche: Journal=International Journal of Foundations of Computer Science AND Volume=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The frontier of decidability in partially observable recursive games
David Auger
,
Olivier Teytaud
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1439-1450
On the edge of decidability in complexity analysis of loop programs
Amir M. Ben-Amram
,
Lars Kristiansen
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1451-1464
Decidability and universality in the axiomatic theory of computability and algorithms
Mark Burgin
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1465-1480
Three applications to rational relations of the high undecidability of the infinite post correspondence problem in a regular
\omega
-language
Olivier Finkel
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1481-1497
Some initial thoughts on bounded query computations over the reals
Klaus Meer
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1499-1510
A tissue P System based solution to quadratic assignment problem
Yunyun Niu
,
K.G. Subramanian
,
Ibrahim Venkat
,
Rosni Abdullah
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1511-1522
On structural analysis of interacting behavioral Petri nets for distributed causal model-based diagnosis
Hammadi Bennoui
,
Allaoua Chaoui
,
Kamel Barkaoui
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1523-1541
Approximating the spanning
k
-tree forest problem
Chung-Shou Liao
,
Louxin Zhang
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1543-1554
Jumping finite automata
Alexander Meduna
,
Petr Zemek
International Journal of Foundations of Computer Science
23
(7), 2012, pp. 1555-1578
On Pansiot words avoiding 3-repetitions
Irina A. Gorbunova
,
Arseny M. Shur
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1583-1594
Constructing premaximal binary cube-free words of any level
Elena A. Petrova
,
Arseny M. Shur
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1595-1609
The critical exponent is computable for automatic sequences
Luke Schaeffer
,
Jeffrey Shallit
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1611-1626
Substitutions over infinite alphabet generating
(-\beta)
-integers
Daniel Dombek
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1627-1639
Unary patterns with involution
Bastian Bischoff
,
James Curry
,
Dirk Nowotka
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1641-1652
Permutation complexity and the letter doubling map
Steven Widmer
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1653-1675
Full monoids and maximal codes
Fabio Burderi
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1677-1690
Bounded Parikh automata
Michaƫl Cadilhac
,
Alain Finkel
,
Pierre McKenzie
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1691-1709
From regular to strictly locally testable languages
Stefano Crespi Reghizzi
,
Pierluigi San Pietro
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1711-1727
Conditional fault diagnosability of dual-cubes
Shuming Zhou
,
Lanxiang Chen
,
Jun-Ming Xu
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1729-1747
Equality sets of morphic word sequences
Juha Honkala
International Journal of Foundations of Computer Science
23
(8), 2012, pp. 1749-1766
Seiten
<
1
2
3
4