Titlebook: Developments in Language Theory; 22nd International C Mizuho Hoshi,Shinnosuke Seki Conference proceedings 2018 Springer Nature Switzerland

labile

察觉

有毒

Site-Directed Deletion, two strings . and ., a site-directed deletion partially deletes a substring of . guided by the string . that specifies which part of a substring can be deleted. We study a few decision problems with respect to the new operation and examine the closure properties of the (iterated) site-directed dele

Phagocytes

EXULT

Weak Cost Register Automata Are Still Powerful, problems pertaining to that model are undecidable, in particular equivalence, disproving a conjecture of Alur et al. from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata.

expository

我不重要

cumulative

Site-Directed Deletion,be deleted. We study a few decision problems with respect to the new operation and examine the closure properties of the (iterated) site-directed deletion operations. We, then, define a site-directed deletion-closed (and -free) language . and investigate its decidability properties when . is regular or context-free.

fulmination

OREX

0302-9743 n, in September 2018. The 39 full papers presented  in this volume were carefully reviewed and selected from 84 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties  of words and languages; grammars, acceptors and transducers for strings, trees, graphi