default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRAIRO - Theoretical Informatics and Applications, Volume 46
Volume 46, Number 1, January 2012
- Fabien Durand
, Gwénaël Richomme:
Special issue dedicated to the thirteenth "Journées Montoises d'Informatique Théorique". 1
- Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina:
On abelian versions of critical factorization theorem. 3-15 - Golnaz Badkobeh, Maxime Crochemore:
Fewest repetitions in infinite binary words. 17-31 - Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen:
An aperiodicity problem for multiwords. 33-50 - Emilie Charlier, Anne Lacroix, Narad Rampersad:
Multi-dimensional sets recognizable in all abstract numeration systems. 51-65 - Sébastien Ferenczi, Pascal Hubert:
Three complexity functions. 67-76 - Anna E. Frid, Luca Q. Zamboni:
On automatic infinite permutations. 77-85 - Christiane Frougny, Karel Klouda:
Rational base number systems for p-adic numbers. 87-106 - Tomás Hejda:
Morphisms preserving the set of words coding three interval exchange. 107-122 - Pascal Ochem, Elise Vaslet:
Repetition thresholds for subdivided graphs and trees. 123-130 - Antonio Restivo, Giovanna Rosone:
On the product of balanced sequences. 131-145 - Alexey V. Samsonov, Arseny M. Shur:
On Abelian repetition threshold. 147-163 - Pedro V. Silva:
Fixed points of endomorphisms of certain free products. 165-179 - Wolfgang Steiner:
On the structure of (-β)-integers. 181-200
Volume 46, Number 2, April 2012
- Eugenio Moggi:
Foreword ICTCS 2010 special issue. 201
- Andrea Polini, Andrea Polzonetti, Barbara Re:
Formal Methods to Improve Public Administration Business Processes. 203-229 - Furio Honsell, Marina Lenisa, Rekha Redamalla:
Equivalences and Congruences on Infinite Conway Games. 231-259 - Domenico Cantone, Andrea Formisano, Marianna Nicolosi Asmundo, Eugenio Giovanni Omodeo:
A graphical representation of relational formulae with complementation. 261-289 - Alberto Carraro, Antonino Salibra:
Easy lambda-terms are not always simple. 291-314 - Laura Giambruno, Sabrina Mantaci:
On the size of transducers for bidirectional decoding of prefix codes. 315-328
Volume 46, Number 3, July 2012
- Meike Akveld, Raphael Bernhard:
Job shop scheduling with unit length tasks. 329-342 - Juntao Gao, Yupu Hu, Xuelian Li:
Linear spans of optimal sets of frequency hopping sequences. 343-354 - Julien Cassaigne, François Nicolas:
On the decidability of semigroup freeness. 355-399 - Lu Zhao, Qiao-Yan Wen:
On the joint 2-adic complexity of binary multisequences. 401-412 - Ugo Dal Lago, Margherita Zorzi:
Probabilistic operational semantics for the lambda calculus. 413-450 - Jing Dong, Qinghui Liu:
Undecidability of infinite post correspondence problem for instances of size 8. 451-457
Volume 46, Number 4, October 2012
- Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). 459-460
- Joël Allred, Ulrich Ultes-Nitsche:
k-counting automata. 461-478 - Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro:
Regularity of languages defined by formal series with isolated cut point. 479-493 - Maria Paola Bianchi, Giovanni Pighizzini:
Normal forms for unary probabilistic automata. 495-510 - Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Affine Parikh automata. 511-545 - Jürgen Dassow, Florin Manea, Bianca Truthe:
Generating Networks of Splicing Processors. 547-572 - Ondrej Klíma, Libor Polák:
On biautomata. 573-592 - Martin Kutrib, Matthias Wendlandt:
String Assembling Systems. 593-613 - Abuzer Yakaryilmaz:
Superiority of one-way and realtime quantum machines. 615-641
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-07 00:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
