@article{Beal-Perrin/06a,
AUTHOR = {B{\'e}al, Marie-Pierre and Perrin, Dominique},
TITLE = {Codes, unambiguous automata and sofic systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {6-13},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sofic shifts, symbolic dynamics, variable length codes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCCFD0-2/2/960eb252b5ca261b8ec35ea0fdf86555},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bertoni-Mereghetti-Palano/06,
AUTHOR = {Bertoni, Alberto and Mereghetti, Carlo and Palano, Beatrice},
TITLE = {Some formal tools for analyzing quantum automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {14-25},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-2/2/76968b9c484d4ed62ca58c41d44d7bdf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brijder-Hoogeboom-Rozenberg/06,
AUTHOR = {Brijder, Robert and Hoogeboom, Hendrik Jan and Rozenberg, Grzegorz},
TITLE = {Reducibility of gene patterns in ciliates using the breakpoint graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {26-45},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-3/2/53e2ae1e0837453293d1bc807e405826},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brzozowski/06,
AUTHOR = {Brzozowski, Janusz A.},
TITLE = {Representation of a class of nondeterministic semiautomata by canonical words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {46-57},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {canonical word, module, nondeterministic, prefix-continuous, prefix-rewriting, semiautomaton, settable, specification, trace assertion},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JBGGGF-1/2/e5c7b60d98e93633cd245eb58ca4aaa1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Castiglione-Restivo-Vaglica/06,
AUTHOR = {Castiglione, Giusi and Restivo, Antonio and Vaglica, Roberto},
TITLE = {A reconstruction algorithm for $L$-convex polyominoes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {58-72},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {polyominoes, convexity, reconstruction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCC4T6-1/2/66e2b9abe389d78e0f0dae7d4b994418},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chaubard-Pin-Straubing/06,
AUTHOR = {Chaubard, Laura and Pin, Jean-{\'E}ric and Straubing, Howard},
TITLE = {Actions, wreath products of $C$-varieties and concatenation product},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {73-89},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, wreath product, varieties of recognizable languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-7/2/f491ee11483d8dc0163a0634568911ba},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cherubini-Crespi_Reghizzi-Pradella-San_Pietro/06,
AUTHOR = {Cherubini, Alessandra and Crespi Reghizzi, Stefano and Pradella, Matteo and San Pietro, Pierluigi},
TITLE = {Picture languages: Tiling systems versus tile rewriting grammars},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {90-103},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {picture language, picture grammar, 2d language, tiling system, recognizable picture language, tile rewriting grammar, 2d regular expression, autoinclusive derivation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JBGGGF-4/2/92fd3d2c3c0f256aadeddd64f21d8b2f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{DAlessandro-Intrigila-Varricchio/06,
AUTHOR = {D'Alessandro, Flavio and Intrigila, Benedetto and Varricchio, Stefano},
TITLE = {On the structure of the counting function of sparse context-free languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {104-117},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sparse language, contex-free language, counting function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-4/2/05293f57e7b9ce053ef3580f2ade9292},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{de_Luca-De_Luca/06,
AUTHOR = {de Luca, Aldo and De Luca, Alessandro},
TITLE = {Some characterizations of finite Sturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {118-125},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian word, standard word, central word},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-9/2/71872a43279de5e1e91b8f8138125753},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diekert-Gastin/06a,
AUTHOR = {Diekert, Volker and Gastin, Paul},
TITLE = {From local to global temporal logics over Mazurkiewicz traces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {126-135},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {temporal logics, mazurkiewicz traces, concurrency},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-5/2/1a9ddfbf050517031d4a257d9c1c2119},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esik/06,
AUTHOR = {{\'E}sik, Zolt{\'a}n},
TITLE = {Characterizing CTL-like logics on finite trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {136-152},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {temporal logic, tree automata, cascade product, pseudovariety},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-B/2/7cb58180b6f9fa03cad726af252fce34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goldwurm-Lonati/06,
AUTHOR = {Goldwurm, Massimiliano and Lonati, Violetta},
TITLE = {Pattern statistics and Vandermonde matrices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {153-169},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata and formal languages, limit distributions, pattern statistics, rational formal series, vandermonde matrices},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JBGGGF-5/2/29528d721b190f5a5d4404050440eb33},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grigorieff/06,
AUTHOR = {Grigorieff, Serge},
TITLE = {Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time $D \lfloor \log_m D\rfloor$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {170-185},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, synchronization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-C/2/8121bdb762530cbc248b5dcd997ae6a8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Harju-Nowotka/06a,
AUTHOR = {Harju, Tero and Nowotka, Dirk},
TITLE = {On unique factorizations of primitive words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {186-189},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {primitive words, baumslag's theorem, critical factorization theorem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JBGGGF-6/2/0b094ead8b8f5745fb42ff7f2e0202c7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra-Ravikumar/06,
AUTHOR = {Ibarra, Oscar H. and Ravikumar, Bala},
TITLE = {On partially blind multihead finite automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {190-199},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {blind head, finite automaton, probabilistic automaton, counter machine, semilinear language},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JBGGGF-2/2/4adb37dc2ee3cb2ac7ec50c2dc20fcbd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karhumaki-Kunc-Okhotin/06a,
AUTHOR = {Karhum{\"a}ki, Juhani and Kunc, Michal and Okhotin, Alexander},
TITLE = {Computing by commuting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {200-211},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {rewriting systems, regular languages, commutation of languages, rational relations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0FVD-1/2/b856197d533a0520df188703df771cf5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Latteux-Lemay-Roos-Terlutte/06,
AUTHOR = {Latteux, Michel and Lemay, Aur{\'e}lien and Roos, Yves and Terlutte, Alain},
TITLE = {Identification of biRFSA languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {212-223},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {non-deterministic finite automata, residual languages, regular inference},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JBGGGF-7/2/89ffbda1cda63513a5f072aca8f72803},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lombardy-Sakarovitch/06,
AUTHOR = {Lombardy, Sylvain and Sakarovitch, Jacques},
TITLE = {Sequential?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {224-244},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, sequential machine, twinning property},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JBGGGF-3/2/6f99aa76ae3a6faf442a4e068e88654c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Neraud/06,
AUTHOR = {N{\'e}raud, Jean},
TITLE = {Completing prefix codes in submonoids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {245-254},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorical problem, formal language, words, free monoid, submonoid, maximal code, dense, complete, weak completeness, completion of codes, regular prefix codes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-8/2/218185fa4e9c2e5396351c38ce6177f7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zielonka/06,
AUTHOR = {Zielonka, Wies{\l}aw},
TITLE = {Time-stamps for Mazurkiewicz traces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {1-2},
PAGES = {255-262},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mazurkiewicz traces, asynchronous automata, finite time-stamps},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JCBJT0-6/2/f602cd2e3ccecc240903ae832660aec2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_Glabbeek/06,
AUTHOR = {van Glabbeek, R.J.},
TITLE = {On the expressiveness of higher dimensional automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {265-290},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrency, expressiveness, causality, higher dimensional automata, petri nets, event structures, history preserving bisimulation, st-bisimulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0FVD-4/2/13b12f61b6d933c3b8ac29eee19d2211},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Theor.~Comput.~Sci., Vol. 368, 2006, No. 1-2, 168-194},
}
@article{Corradini-Di_Berardini-Vogler/06a,
AUTHOR = {Corradini, F. and Di Berardini, M.R. and Vogler, W.},
TITLE = {Fairness of components in system computations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {291-324},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {process algebras, timed process algebras, worst-case efficiency, fairness of actions, fairness of components, liveness properties},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0XYK-1/2/24c4c54e28cd46737244d41c2626bcf0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Andova-Willemse/06,
AUTHOR = {Andova, Suzana and Willemse, Tim A.C.},
TITLE = {Branching bisimulation for probabilistic systems: Characteristics and decidability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {325-355},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {branching bisimulation, probabilistic systems, alternating model, abstraction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0XYK-2/2/0d63a28b139be9207bfbaf38dfe8e1a8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beffara-Maurel/06,
AUTHOR = {Beffara, Emmanuel and Maurel, Fran{\c{c}}ois},
TITLE = {Concurrent nets: A study of prefixing in process calculi},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {356-373},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$\pi$]-calculus, fusion calculus, graphical syntax, prefixing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0XYK-3/2/e32216f9b302d2c5f635fef73ce8cd58},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Finkel-Geeraerts-Raskin-Van_Begin/06,
AUTHOR = {Finkel, A. and Geeraerts, G. and Raskin, J.-F. and Van Begin, L.},
TITLE = {On the $\omega$-language expressive power of extended Petri nets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {374-386},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {(extended) petri nets, [omega]-languages, expressiveness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0XYK-4/2/9ea39c8ee3bfc884451f926cb054cc6a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Nicola-Gorla-Pugliese/06,
AUTHOR = {De Nicola, Rocco and Gorla, Daniele and Pugliese, Rosario},
TITLE = {On the expressive power of KLAIM-based calculi},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {387-421},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {process calculi, network-aware programming, expressiveness, language encodings, behavioural equivalences, bisimulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0XYK-5/2/3d49da2e11f9be0dfa6a91faa2dda6cc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bundgaard-Hildebrandt-Godskesen/06,
AUTHOR = {Bundgaard, Mikkel and Hildebrandt, Thomas and Godskesen, Jens Chr.},
TITLE = {A CPS encoding of name-passing in higher-order mobile embedded resources},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {422-439},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$\pi$-calculus, name-passing encoding, process-passing, nested locations, continuation-passing, explicit substitutions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0XYK-6/2/a866deba8bcfe1740f09cca2a3d912b5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guan/06,
AUTHOR = {Guan, Xudong},
TITLE = {Name-passing in an ambient-like calculus and its proof using spatial logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {440-467},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ambient calculus, [pi]-calculus, operational correspondence, spatial logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JDMMW1-1/2/f0ccbfd91bb5108f944278c093fb088d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Phillips-Vigliotti/06,
AUTHOR = {Phillips, Iain and Vigliotti, Maria Grazia},
TITLE = {Leader election in rings of ambient processes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {356},
NUMBER = {3},
PAGES = {468-494},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ambient calculi, leader election, electoral system, ring, expressiveness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JD0FVD-5/2/9f4ac628c219a114e2997886d310185d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}