Titlebook: Automata, Languages and Programming; 22nd International C Zoltán Fül?p,Ferenc Gécseg Conference proceedings 1995 Springer-Verlag Berlin Hei

不能逃避

地名詞典

On the construction of classes of suffix trees for square matrices: Algorithms and applications,y the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on .. We provide . simple algorithm that efficiently builds any chosen index in those classes in O(n. log .) . time using ..) space. The algorithm can be modified to require optimal ..) . for bounded ..

AMPLE

經(jīng)典

Wolfgang Melzer,Wilfried SchubarthWe generalize the characterization of abstract families of languages (AFLs) by abstract families of acceptors to Ω-continuous semirings.

neurologist

胰臟

The algebraic equivalent of AFL theory,We generalize the characterization of abstract families of languages (AFLs) by abstract families of acceptors to Ω-continuous semirings.

Commentary

Post correspondence problem: Words possible as primitive solutions,Three types of “primitive” or “prime” solutions for PCP have earlier been investigated. The sets of words belonging to one of the three types (for some instance of PCP) form an increasing hierarchy. In our main result we show that the hierarchy is proper, except the binary case. We also give a sharpened characterization of the finite type.

刺激

https://doi.org/10.1007/3-540-60084-1Automat; algorithm; algorithms; automata; communication; complexity; formal language; programming; semantics

Overthrow

burnish