By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
Teaching engineering students courses such as computer science theory, automata theory and discrete mathematics took us to realize that introducing basic notions of logic, especial...
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank S...
We propose a self-organizing sleep-wake sensor system that is scalable, easily implemented, and energy conserving. An application of concepts from cellular automata theory account...
Kyung Joon Kwak, Yuliy M. Baryshnikov, Edward G. C...