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=International Journal of Foundations of Computer Science AND Volume=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Regular expressions for querying data graphs
Tony Tan
,
Domagoj Vrgoc̑
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 971-985
Finite automata with advice tapes
Ug̑ur Küçük
,
A.C. Cem Say
,
Abuzer Yakaryilmaz
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 987-1000
Operational characterization of scattered MCFLs
Zoltán Ésik
,
Szabolcs Iván
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1001-1015
Prefix picture codes: A decidable class of two-dimensional codes
Marcella Anselmo
,
Dora Giammarresi
,
Maria Madonia
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1017-1031
On the dual post correspondence problem
Joel D. Day
,
Daniel Reidenbach
,
Johannes C. Schneider
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1033-1048
Inner palindromic closure
Jürgen Dassow
,
Florin Manea
,
Robert Mercaş
,
Mike Müller
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1049-1063
On the decidability of the intersection problem for quantum automata and context-free languages
Alberto Bertoni
,
Christian Choffrut
,
Flavio D'Alessandro
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1065-1081
Adjacent ordered multi-pushdown systems
Mohamed Faouzi Atig
,
K. Narayan Kumar
,
Prakash Saivasan
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1083-1096
On the number of Abelian bordered words (with an example of automatic theorem-proving)
Daniel Goc̑
,
Narad Rampersad
,
Michel Rigo
,
Pavel Salimov
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1097-1110
Factorizations and universal automaton of omega languages
Vincent Carnino
,
Sylvain Lombardy
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1111-1125
Some decision questions concerning the time complexity of language acceptors
Oscar H. Ibarra
,
Bala Ravikumar
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1127-1140
Stateless one-way multi-head finite automata with pebbles
Martin Kutrib
,
Andreas Malcher
,
Matthias Wendlandt
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1141-1159
Sorting conjugates and suffixes of words in a multiset
Silvia Bonomo
,
Sabrina Mantaci
,
Antonio Restivo
,
Giovanna Rosone
,
Marinella Sciortino
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1161-1175
Seiten
<
1
2
3