%0 Conference Proceedings
%T Two Results on Discontinuous Input Processing
%+ Univerzita Karlova [Praha, Česká republika] = Charles University [Prague, Czech Republic] (UK)
%A Vorel, Vojtěch
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
%C Bucharest, Romania
%Y Cezar Câmpeanu
%Y Florin Manea
%Y Jeffrey Shallit
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-9777
%P 205-216
%8 2016-07-05
%D 2016
%R 10.1007/978-3-319-41114-9_16
%Z Computer Science [cs]Conference papers
%X First, we show that universality and other properties of general jumping finite automata are undecidable, which answers questions asked by Meduna and Zemek in 2012 [12]. Second, we close a study started by Černo and Mráz in 2010 [3] by proving that a clearing restarting automaton using contexts of length two can accept a binary non-context-free language.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01633950/document
%2 https://inria.hal.science/hal-01633950/file/416473_1_En_16_Chapter.pdf
%L hal-01633950
%U https://inria.hal.science/hal-01633950
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-LNCS-9777
%~ IFIP-WG1-2