


default search action
Theoretical Computer Science, Volume 450
Volume 450, September 2012
- Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel:

Obituary for Sheng Yu. 1 - Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel:

Preface. 2
- Pavel Martyugin:

Complexity of problems concerning reset words for cyclic and Eulerian automata. 3-9 - Jan Daciuk, Dawid Weiss:

Smaller representation of finite state automata. 10-21 - Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret:

Categorial grammars with iterated types form a strict hierarchy of k-valued languages. 22-30 - Vincent Carnino, Sven De Felice:

Sampling different kinds of acyclic automata using Markov chains. 31-42 - Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko

:
Loops and overloops for Tree-Walking Automata. 43-53 - Yo-Sub Han, Sang-Ki Ko

:
Analysis of a cellular automaton model for car traffic with a junction. 54-67 - Markus Holzer

, Martin Kutrib
, Katja Meckel:
Nondeterministic state complexity of star-free languages. 68-80 - Giuseppa Castiglione

, Antonio Restivo, Marinella Sciortino:
Nondeterministic Moore automata and Brzozowski's minimization algorithm. 81-91 - José M. Castaño, Rodrigo Castaño:

A finite state intersection approach to propositional satisfiability. 92-108 - Supaporn Chairungsee, Maxime Crochemore

:
Using minimal absent words to build phylogeny. 109-116

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














