@article{Martyugin/12,
AUTHOR = {Martyugin, Pavel},
TITLE = {Complexity of problems concerning reset words for cyclic and Eulerian automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {3-9},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {synchronization, automata, reset words, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003775},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Daciuk-Weiss/12,
AUTHOR = {Daciuk, Jan and Weiss, Dawid},
TITLE = {Smaller representation of finite state automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {10-21},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003787},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bechet-Dikovsky-Foret/12,
AUTHOR = {B{\'e}chet, Denis and Dikovsky, Alexandre and Foret, Annie},
TITLE = {Categorial grammars with iterated types form a strict hierarchy of $k$-valued languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {22-30},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal grammars, categorial grammars, language hierarchy, iterated types},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003799},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carnino-De_Felice/12,
AUTHOR = {Carnino, Vincent and De Felice, Sven},
TITLE = {Sampling different kinds of acyclic automata using Markov chains},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {31-42},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003805},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heam-Hugot-Kouchnarenko/12,
AUTHOR = {H{\'e}am, Pierre-Cyrille and Hugot, Vincent and Kouchnarenko, Olga},
TITLE = {Loops and overloops for Tree-Walking Automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {43-53},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree-walking automata, loops, overloops, membership, emptiness, approximation},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003817},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Ko/12,
AUTHOR = {Han, Yo-Sub and Ko, Sang-Ki},
TITLE = {Analysis of a cellular automaton model for car traffic with a junction},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {54-67},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, car traffic, traffic junction, form-one-lane rule, merge-lane rule},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003829},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Holzer-Kutrib-Meckel/12,
AUTHOR = {Holzer, Markus and Kutrib, Martin and Meckel, Katja},
TITLE = {Nondeterministic state complexity of star-free languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {68-80},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {star-free languages, nondeterministic finite automata, operational state complexity, descriptional complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003830},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Castiglione-Restivo-Sciortino/12,
AUTHOR = {Castiglione, G. and Restivo, A. and Sciortino, M.},
TITLE = {Nondeterministic Moore automata and Brzozowski's minimization algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {81-91},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {nondeterministic moore automata, brzozowski's minimization algorithm, automata minimization},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003842},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Castano-Castano/12,
AUTHOR = {Casta{\~n}o, Jos{\'e} M. and Casta{\~n}o, Rodrigo},
TITLE = {A finite state intersection approach to propositional satisfiability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {92-108},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {all-sat, model counting, fsa intersection, regular expression compilation, intersection grammars (fsig)},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003854},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chairungsee-Crochemore/12,
AUTHOR = {Chairungsee, Supaporn and Crochemore, Maxime},
TITLE = {Using minimal absent words to build phylogeny},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {450},
PAGES = {109-116},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {minimal absent words, forbidden words, trie of bounded depth, string similarity, phylogeny construction},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512003866},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}