Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

On Reachability for Unidirectional Channel Systems Extended with Regular Tests

Jancar Petr ; Prateek Karandikar ; Philippe Schnoebelen.
"Unidirectional channel systems" (Chambart & Schnoebelen, CONCUR 2008) are finite-state systems where one-way communication from a Sender to a Receiver goes via one reliable and one unreliable unbounded fifo channel. While reachability is decidable for these systems, equipping them with the&nbsp;[&hellip;]
Published on April 17, 2015
Volume 11, Issue 2

The height of piecewise-testable languages and the complexity of the logic of subwords

Prateek Karandikar ; Philippe Schnoebelen.
The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been investigated in a systematic way. This article develops a series&nbsp;[&hellip;]
Published on April 30, 2019
Volume 15, Issue 2
  • < Previous
  • 1
  • Next >