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

使困惑

執(zhí)拗

Human-Computer Systems Interaction 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

野蠻

誘拐

A Brief Excursion to Parity Games,terms of running time, this is currently the most efficient algorithm that solves the parity games problem. The goal of this lecture is to give a brief background to the problem and present the algorithm in a somewhat informal way with a bit more emphasis on ideas rather than formal details.

botany

A Tale of Conjunctive Grammars,ubstring that satisfies several syntactic conditions simultaneously. This family has been systematically studied since the turn of the century, and is a subject of current studies. This paper gives an overview of the current state of the art in the research on conjunctive grammars.