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

Bumble

Unary Language Operations and Their Nondeterministic State Complexityeterministic finite automata. In particular, we consider Boolean operations, concatenation, iteration, and λ-free iteration. Most of the bounds are tight in the exact number of states, i.e. the number is sufficient and necessary in the worst case. For the complementation of infinite languages a tigh

floodgate

Insatiable

Roots and Powers of Regular Languagesive words . such that .. belongs to . for some . ≥ 1. There is a strong connection between the root and the powers of a regular language . namely, the .-power of . for an arbitrary finite set . with 0, 1, 2 ?, . is regular if and only if the root of . is finite. If the root is infinite then the .-po

PRISE

Efficient Transformations from Regular Expressions to Finite Automataved the size of the resulting automaton from .(..) to .(.(log .).), and even .(. log .) for bounded alphabet size (where . is the size of the regular expression). A lower bound [.] shows this to be close to optimal, and also one of those constructions can be computed in optimal time [.].

ETCH

Decision Problems for Linear and Circular Splicing Systemshe framework of formal language theory. In spite of a vast literature on splicing systems, briefly surveyed here, a few problems related to their computational power are still open. We intend to evidence how classical techniques and concepts in automata theory are a legitimate tool for investigating some of these problems.

commensurate

figment

Roots and Powers of Regular Languages .-power of . for an arbitrary finite set . with 0, 1, 2 ?, . is regular if and only if the root of . is finite. If the root is infinite then the .-power for most regular sets . is context-sensitive but not context-free. The stated property is decidable.

上腭

反省

Wie Jungen mit Wrestling umgehennsional stochastic Turing machines (2-stm’s)”, and shows that for any . ≤ .(.) = .(.), .(.) space-bounded 2-ptm’s with bounded error are less powerful than .(.) space-bounded 2-stm’s with bounded error which start in nondeterministic mode, and make only one alternation between nondeterministic and probabilistic modes.

邊緣

Rousseau, Schiller, Herder, Heinseved the size of the resulting automaton from .(..) to .(.(log .).), and even .(. log .) for bounded alphabet size (where . is the size of the regular expression). A lower bound [.] shows this to be close to optimal, and also one of those constructions can be computed in optimal time [.].