


default search action
Words, Languages & Combinatorics 2000: Kyoto, Japan
- Masami Ito, Teruo Imaoka:

Proceedings of the International Colloquium on Words, Languages & Combinatorics III, Kyoto, Japan, March 14-18, 2000. World Scientific 2003, ISBN 978-9810249489 - Jorge Almeida, Ana Paula Escada:

Semidirect Products With the Pseudovariety of All Finite Groups. Words, Languages & Combinatorics 2000: 1-21 - Adrian Atanasiu, Carlos Martín-Vide, Victor Mitrana:

On the Sentence Valuations in a Semiring. Words, Languages & Combinatorics 2000: 22-39 - Karl Auinger:

Join Decompositions of Pseudovarieties of the Form DH ECom. Words, Languages & Combinatorics 2000: 40-50 - Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid:

Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62 - Vasco Brattka:

The Emperor's New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability. Words, Languages & Combinatorics 2000: 63-72 - Thomas Buchholz, Andreas Klein, Martin Kutrib:

Iterative Arrays With Limited Nondeterministic Communication Cell. Words, Languages & Combinatorics 2000: 73-87 - Olivier Carton:

R-Trivial Languages of Words on Countable Ordinals. Words, Languages & Combinatorics 2000: 88-102 - Christian Choffrut, Serge Grigorieff:

The Theory of Rational Relations on Transfinite Strings. Words, Languages & Combinatorics 2000: 103-133 - Erzsébet Csuhaj-Varjú, Arto Salomaa:

Networks of Watson-Crick D0L Systems. Words, Languages & Combinatorics 2000: 134-150 - Jürgen Dassow:

On the Differentiation Function of some Language Generating Devices. Words, Languages & Combinatorics 2000: 151-161 - Maria Demeny, Géza Horváth, Csaba Nagylaki, Zoltan Nagylaki:

Visualization of Cellular Automata. Words, Languages & Combinatorics 2000: 162-170 - Do Long Van:

On A Class of Hypercodes. Words, Languages & Combinatorics 2000: 171-182 - Pál Dömösi, Masami Ito:

A Parsing Problem for Context-Sensitive Languages. Words, Languages & Combinatorics 2000: 183-184 - Pál Dömösi, Manfred Kudlek:

An Improvement of Iteration Lemmata for Context-free Languages. Words, Languages & Combinatorics 2000: 185-191 - Jozef Gruska, Roland Vollmar:

Quantum Finite Automata. Words, Languages & Combinatorics 2000: 192-211 - Balázs Imreh, Masami Ito, Antal Pukler:

On Commutative Asynchronous Automata. Words, Languages & Combinatorics 2000: 212-221 - Isamu Inata:

Presentations of Right Unitary Submonoids of Monoids. Words, Languages & Combinatorics 2000: 222-227 - Andrei V. Kelarev, Peter G. Trotter:

A Combinatorial Property of Languages and Monoids. Words, Languages & Combinatorics 2000: 228-239 - Stavros Konstantinidis:

Error-Detecting Properties of Languages. Words, Languages & Combinatorics 2000: 240-252 - Takeshi Koshiba, Kunihiko Hiraishi:

A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples. Words, Languages & Combinatorics 2000: 253-265 - Sylvain Lombardy, Jacques Sakarovitch:

On the Star Height of Rational Languages: A New Presentation for Two Old Results. Words, Languages & Combinatorics 2000: 266-285 - Hajime Machida:

Some Properties of Hyperoperations and Hyperclones. Words, Languages & Combinatorics 2000: 286-296 - Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov:

Words Guaranteeing Minimal Image. Words, Languages & Combinatorics 2000: 297-310 - Stuart W. Margolis, Benjamin Steinberg:

Power Semigroups and Polynomial Closure. Words, Languages & Combinatorics 2000: 311-322 - Alexandru Mateescu:

Routes and Trajectories. Words, Languages & Combinatorics 2000: 323-338 - Ryuki Matsuda:

Characterization of Valuation Rings and Valuation Semigroups by Semistar-Operations. Words, Languages & Combinatorics 2000: 339-351 - Gundula Niemann, Friedrich Otto:

Further Results on Restarting Automata. Words, Languages & Combinatorics 2000: 352-369 - Hidenosuke Nishio:

Cellular Automata with Polynomials over Finite Fields. Words, Languages & Combinatorics 2000: 370-377 - Zarko Popovic, Stojan Bogdanovic, Tatjana Petkovic, Miroslav Ciric:

Generalized Directable Automata. Words, Languages & Combinatorics 2000: 378-395 - Tatsuhiko Saito:

Acts over Right, Left Regular Bands and Semilattices Types. Words, Languages & Combinatorics 2000: 396-402 - René Schott, Jean-Claude Spehner:

Two Optimal Parallel Algorithms on the Commutation Class of a Word. Words, Languages & Combinatorics 2000: 403-419 - Kunitaka Shoji:

A Proof of Okninski, Putcha's Theorem. Words, Languages & Combinatorics 2000: 420-427 - Kar Ping Shum, Malay K. Sen, Y. Q. Guo:

Subdirect Product Structure of Left Clifford Semigroups. Words, Languages & Combinatorics 2000: 428-433 - Magnus Steinby:

Tree Automata in the Theory of Term Rewriting. Words, Languages & Combinatorics 2000: 434-449 - Akihiro Yamamura, Kaoru Kurosawa:

Key Agreement Protocol Securer than DLOG. Words, Languages & Combinatorics 2000: 450-465 - Mariko Yasugi, Masako Washihara:

A Note on Rademacher Functions and Computability. Words, Languages & Combinatorics 2000: 466-475

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














