default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 328
Volume 328, Number 1-2, November 2004
- Oscar H. Ibarra:
Editorial. 1
- Cyril Allauzen, Mehryar Mohri:
An optimal pre-determinization algorithm for weighted transducers. 3-18 - Xiang Fu
, Tevfik Bultan, Jianwen Su:
Conversation protocols: a formalism for specification and verification of reactive electronic services. 19-37 - Franck Guingne, Florent Nicart, André Kempe:
Acyclic networks maximizing the printing complexity. 39-51 - Dietrich Kuske, Ingmar Meinecke:
Branching automata with costs - a way of reflecting parallelism in costs star. 53-75 - Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch:
Introducing VAUCANSON. 77-96 - Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary directed acyclic word graphs. 97-111 - Bala Ravikumar, Gerry Eisman:
Weak minimization of DFA - an algorithm and applications. 113-133 - Hellis Tamm, Esko Ukkonen:
Bideterministic automata and minimal representations of regular languages. 135-149 - A. N. Trahtman:
Reducing the time complexity of testing for local threshold testability. 151-160 - Lynette van Zijl:
On binary ⊕-NFAs and succinct descriptions of regular languages. 161-170 - Manuel Vilares Ferro, Victor M. Darriba, Jesús Vilares, Francisco J. Ribadas:
A formal frame for robust parsing. 171-186 - Farn Wang, Hsu-Chun Yen:
Reachability solution characterization of parametric real-time systems. 187-201 - Gaoyan Xie, Cheng Li, Zhe Dang:
Linear reachability problems and minimal solutions to linear Diophantine equation systems. 203-219
Volume 328, Number 3, December 2004
- Maurizio Alvarez-Manilla, Achim Jung, Klaus Keimel:
The probabilistic powerdomain for stably compact spaces. 221-244 - Hejiao Huang, To-Yat Cheung, Wai Ming Mak:
Structure and behavior preservation by Petri-net-based refinements in system design. 245-269 - Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan:
Enhancing global SLS-resolution with loop cutting and tabling mechanisms. 271-287 - Patrick Baillot:
Type inference for light affine logic via constraints on words. 289-323 - Reiner Hähnle, Neil V. Murray, Erik Rosenthal:
Linearity and regularity with negation normal form. 325-354 - John Foy:
A dynamical system which must be stable whose stability cannot be proved. 355-361
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-11 23:06 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:
