Abstract We present the tool Ranker for complementing Büchi automata (BAs). builds on our previous optimizations of rank-based BA complementation and pushes them even further using numerous heuristics to produce smaller automata. Moreover, it contains novel specialized constructions (i) inherently weak (ii) semi-deterministic automata, all delivered in a robust tool. The significantly improve u...

Abstract Sequence theories are an extension of strings with infinite alphabet letters, together a corresponding theory (e.g. linear integer arithmetic). Sequences natural abstractions extendable arrays, which permit wealth operations including append, map, split, and concatenation. In spite the growing amount tool support for sequences by leading SMT-solvers, little is known about decidability ...

We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These reflect the distributed nature underlying causality concurrency between events, can be said support true concurrency. They generalize that have been so efficient in understanding, classifying reasoning word languages. In particular, we introduce an v...

 Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...

In this contribution, we reconsider the notion of determinism for max-plus automata by including quantitative aspect in its definition. A determinization procedure adapted to so-called weight-determinism is proposed. The motivation generalize results based on automata.

While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than wei...

This article studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely, those generated by collapsible pushdown automata. The main motivation for studying these comes from the connections automata and higher-order recursion schemes, both models being equi-expressive generating trees. Our result is to establish decidability such provide an effecti...

We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing automata.