Titlebook: Developments in Language Theory; 24th International C Nataša Jonoska,Dmytro Savchuk Conference proceedings 2020 Springer Nature Switzerland

向外供接触

epicardium

atopic

J. Holfert,H. Thoms,E. Mylius,K. F. Jordanne of a splicing system is the “splicing operation”, a cut-and-paste binary string operation defined by a set of “splicing rules”, quadruples . where . are words over an alphabet .. For two strings . and ., applying the splicing rule . produces the string .. In this paper we focus on a particular ty

内疚

J. Holfert,H. Thoms,E. Mylius,K. F. Jordanthat there is an operator that has an absorbing pattern and prove that if we use this property to simplify a uniform random expression with . nodes, then the expected size of the result is bounded by a constant. In our framework, expressions are defined using a combinatorial system, which describes

mastoid-bone

Schule in Distanz – Kindheit in Krisentinuous direction whenever . is not sofic. This has the corollary that non-sofic beta-shifts are topologically direct prime, i.e. they are not conjugate to direct topological factorizations . of two nontrivial subshifts . and .. We also make some preliminary observations on direct topological facto

浮夸

多产子

Historische Kompetenzen und das Internetmed if all words are prefixes of words in .. We show that well-formedness of a context-free language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide for the class 2-. of non-linear tree transducers with out

ITCH

Carsten Schulte,Maria Knobelsdorfis located strictly between the local tree grammars and the regular tree grammars. A decision procedure for the problem of determining whether a tree substitution grammar generates a local tree language is provided. Unfortunately, the class of tree substitution languages is neither closed under unio

Coronary

Historische Kompetenzen und das Internet-time computation. The model considered is that of ACAs, which are language acceptors whose acceptance condition depends on the states of all cells in the automaton. We prove a time hierarchy theorem for sublinear-time ACA classes, analyze their intersection with the regular languages, and, finally,

FID

https://doi.org/10.1007/978-3-658-31748-5A modifier is a .-ary operator acting on DFAs and producing a DFA. Modifiers are involved in the theory of state complexity. We define and study a class of simple modifiers, called product modifiers, and we link closely the regular operations they encode to boolean operations.