Titlebook: Developments in Language Theory; 6th International Co Masami Ito,Masafumi Toyama Conference proceedings 2003 Springer-Verlag Berlin Heidelb

CORD

Constructing Infinite Words of Intermediate Complexity

inferno

Finasteride

Zur Geschichte des H?lderlinschen NachlassesWe associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.

conduct

倔強一點

開始從未

Cognizance

H?llen-Inszenierung ?Wrestling“We improve the known bounds on the number of pairwise non-isomorphic minimal deterministic finite automata (DFAs) on . states which accept finite languages. The lower bound constructions are iterative approaches which yield recurrence relations.

清洗

Exterior

Finite Automata Models of Quantized Systems: Conceptual Status and OutlookSince Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity. We review automaton complementarity, reversible automata and the connections to generalized urn models. Recent developments in quantum information theory may have appropriate formalizations in the automaton context.

警告

Automata on Linear OrderingsWe consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce automata and rational expressions for words on linear orderings.