56 citations · 231 across the 17 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
cs.LO2008
Model checking memoryful linear-time logics over one-counter automata
Stephane Demri, Ranko Lazic, Arnaud Sangnier
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL) and for first-order logic with data equality tests over one-counter automata. W…
cs.LO2008★ 3 cited
Alternating Automata on Data Trees and XPath Satisfiability
Marcin Jurdzinski, Ranko Lazic
A data tree is an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and an element ("datum") from an infinite set, where the latter can only be…
cs.LO2008★ 1 cited
Safety alternating automata on data words
Ranko Lazic
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety one-way altern…