Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce

NEG

Sofic-Dyck Shiftsifts is a particular class of shifts of sequences whose finite factors are unambiguous context-free languages. We show that it corresponds exactly to shifts of sequences whose set of factors is a visibly pushdown language. We give an expression of the zeta function of a sofic-Dyck shift which has a deterministic presentation.

ambivalence

Alternating Parity Krivine Automatagic is decidable over finite structures. We present an automaton model that captures the semantics of HFL. This automaton model combines alternating parity automata with the lookup mechanisms from the Krivine machine.

行乞

fulcrum

gerrymander

性上瘾

修正案

单纯

可耕种

Subword Complexity and Decomposition of the Set of Factorse that the class . coincides with the class of infinite words of linear complexity. On the other hand, although the class . is included in the class of words of complexity .(..), this inclusion is strict for . > 2.

针叶树

Conference proceedings 2014tions of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Al