19 citations · 55 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.FL2014★ 7 cited
Operations on Automata with All States Final
Kristína Čevorová, Galina Jirásková, Peter Mlynárčik +2
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages…
cs.FL2014
On Upper and Lower Bounds on the Length of Alternating Towers
Štěpán Holub, Galina Jirásková, Tomáš Masopust
A tower between two regular languages is a sequence of strings such that all strings on odd positions belong to one of the languages, all strings on even positions belong to the ot…