Masami Ito, Teruo Imaoka
Proceedings of the Third International Colloquium on Words, Languages & Combinatorics
Words, Languages & Combinatorics, 2000.

@proceedings{WLC-2000,
	address       = "Kyoto, Japan",
	editor        = "Masami Ito and Teruo Imaoka",
	ee            = "http://www.worldscibooks.com/compsci/4959.html",
	isbn          = "978-9810249489",
	publisher     = "{World Scientific}",
	title         = "{Proceedings of the Third International Colloquium on Words, Languages & Combinatorics}",
	year          = 2000,
}

Contents (36 items)

7 ×#automaton
5 ×#on the
4 ×#word
3 ×#finite
2 ×#formal method
2 ×#monad
2 ×#pseudo

WLC-2000-AlmeidaE #finite #pseudo

Semidirect Products With the Pseudovariety of All Finite Groups (JA, APE), pp. 1–21.

WLC-2000-AtanasiuMM #on the

On the Sentence Valuations in a Semiring (AA, CMV, VM), pp. 22–39.

WLC-2000-Auinger #pseudo

Join Decompositions of Pseudovarieties of the Form DH ECom (KA), pp. 40–50.

WLC-2000-AvgustinovichFF #complexity #infinity #word

Arithmetical Complexity of Infinite Words (SVA, DFDF, AEF), pp. 51–62.

WLC-2000-Brattka #exponential #modelling #recursion

The Emperor’s New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability (VB), pp. 63–72.

WLC-2000-BuchholzKK #array #communication #nondeterminism

Iterative Arrays With Limited Nondeterministic Communication Cell (TB, AK, MK), pp. 73–87.

WLC-2000-Carton #word

R-Trivial Languages of Words on Countable Ordinals (OC), pp. 88–102.

WLC-2000-ChoffrutG #formal method #string

The Theory of Rational Relations on Transfinite Strings (CC, SG), pp. 103–133.

WLC-2000-Csuhaj-VarjuS #network

Networks of Watson-Crick D0L Systems (ECV, AS), pp. 134–150.

WLC-2000-Dassow #difference #generative #on the

On the Differentiation Function of some Language Generating Devices (JD), pp. 151–161.

WLC-2000-DemenyHNN #automaton #visualisation

Visualization of Cellular Automata (MD, GH, CN, ZN), pp. 162–170.

WLC-2000-Van #on the

On A Class of Hypercodes (DLV), pp. 171–182.

WLC-2000-DomosiI #context-sensitive grammar #parsing #problem

A Parsing Problem for Context-Sensitive Languages (PD, MI), pp. 183–184.

WLC-2000-DomosiK #context-free grammar

An Improvement of Iteration Lemmata for Context-free Languages (PD, MK), pp. 185–191.

WLC-2000-GruskaV #automaton #finite #quantum

Quantum Finite Automata (JG, RV), pp. 192–211.

WLC-2000-ImrehIP #automaton #commutative #on the

On Commutative Asynchronous Automata (BI, MI, AP), pp. 212–221.

WLC-2000-Inata #monad

Presentations of Right Unitary Submonoids of Monoids (II), pp. 222–227.

WLC-2000-KelarevT #combinator #monad

A Combinatorial Property of Languages and Monoids (AVK, PGT), pp. 228–239.

WLC-2000-Konstantinidis #detection

Error-Detecting Properties of Languages (SK), pp. 240–252.

WLC-2000-KoshibaH #consistency

A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples (TK, KH), pp. 253–265.

WLC-2000-LombardyS #on the

On the Star Height of Rational Languages: A New Presentation for Two Old Results (SL, JS), pp. 266–285.

WLC-2000-Machida

Some Properties of Hyperoperations and Hyperclones (HM), pp. 286–296.

WLC-2000-MargolisPV #image #word

Words Guaranteeing Minimal Image (SWM, JÉP, MVV), pp. 297–310.

WLC-2000-MargolisS #polynomial

Power Semigroups and Polynomial Closure (SWM, BS), pp. 311–322.

WLC-2000-Mateescu

Routes and Trajectories (AM), pp. 323–338.

WLC-2000-Matsuda

Characterization of Valuation Rings and Valuation Semigroups by Semistar-Operations (RM), pp. 339–351.

WLC-2000-NiemannO #automaton

Further Results on Restarting Automata (GN, FO), pp. 352–369.

WLC-2000-Nishio #automaton #finite

Cellular Automata with Polynomials over Finite Fields (HN), pp. 370–377.

WLC-2000-PopovicBPC #automaton

Generalized Directable Automata (ZP, SB, TP, MC), pp. 378–395.

WLC-2000-Saito

Acts over Right, Left Regular Bands and Semilattices Types (TS), pp. 396–402.

WLC-2000-SchottS #algorithm #parallel #word

Two Optimal Parallel Algorithms on the Commutation Class of a Word (RS, JCS), pp. 403–419.

WLC-2000-Shoji #proving #theorem

A Proof of Okninski, Putcha’s Theorem (KS), pp. 420–427.

WLC-2000-ShumSG

Subdirect Product Structure of Left Clifford Semigroups (KPS, MKS, YQG), pp. 428–433.

WLC-2000-Steinby #automaton #formal method #term rewriting

Tree Automata in the Theory of Term Rewriting (MS), pp. 434–449.

WLC-2000-YamamuraK #protocol

Key Agreement Protocol Securer than DLOG (AY, KK), pp. 450–465.

WLC-2000-YasugiW

A Note on Rademacher Functions and Computability (MY, MW), pp. 466–475.