default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 38
Volume 38, Number 1, January-March 2004
- Stephen L. Bloom, Zoltán Ésik:
Axiomatizing omega and omega-op powers of words. 3-17 - Ulrike Brandt, Ghislain Delepine, Hermann K.-G. Walter:
Weightreducing grammars and ultralinear languages. 19-25 - Wit Forys:
Asymptotic behaviour of bi-infinite words. 27-48 - Pedro V. Silva
:
Free group languages: Rational versus recognizable. 49-67 - Alexander Okhotin:
On the equivalence of linear conjunctive grammars and trellis automata. 69-88
Volume 38, Number 2, April-June 2004
- Nguyen Huong Lam:
Finite Completion of comma-free codes. Part 1. 91-115 - Nguyen Huong Lam:
Finite Completion of comma-free codes. Part 2. 117-136 - Richard Královic:
Time and space complexity of reversible pebbling. 137-161 - Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Complexity of infinite words associated with beta-expansions. 163-185
Volume 38, Number 3, July-September 2004
- Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Circular splicing and regularity. 189-228 - Marius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rémila:
Algebraic tools for the construction of colored flows with boundary constraints. 229-243 - Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas:
Monoid presentations of groups by finite special string-rewriting systems. 245-256 - Jürgen Dassow, Victor Mitrana, Gheorghe Paun, Ralf Stiebe:
On differentiation functions, structure functions, and related languages of context-free grammars. 257-267 - Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Erratum: Corrigendum: Complexity of infinite words associated with beta-expansions. 269-271
Volume 38, Number 4, October-December 2004
- Zoltán Ésik, Igor Walukiewicz:
Foreword. 275-276 - Andreas Abel:
Termination checking with types. 277-319 - Neil Ghani, Tarmo Uustalu:
Coproducts of Ideal Monads. 321-342 - Martin Grohe, Nicole Schweikardt:
Comparing the succinctness of monadic query languages over finite trees. 343-373 - Eugenio Moggi, Amr Sabry:
An abstract monadic semantics for value recursion. 375-400
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-01-24 17:15 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:
