4 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.FL2023★ 2 cited
Unboundedness problems for machines with reversal-bounded counters
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi +4
We consider a general class of decision problems concerning formal languages, called ``(one-dimensional) unboundedness predicates'', for automata that feature reversal-bounded coun…
cs.FL2010★ 4 cited
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems
Ian McQuillan, Giovanni Pighizzini
The 12th annual workshop, Descriptional Complexity of Formal Systems 2010, is taking place in Saskatoon, Canada, on August 8-10, 2010. It is jointly organized by the IFIP Working G…