Anatoly Chebotarev

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The language L is used for specifying finite automata, and is a fragment of a first order language with monadic predicates. Checking specification for satisfiability plays an important role in the development of reactive algorithms. Restricted syntax of this language and interpreting it over the integers make it possible to substantially improve(More)
  • 1