All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

17 794 (0,112s)

Result

libSFTA: A Semi-symbolic Nondeterministic Finite Tree Automata Library Prototype

This library implements semi-symbolically encoded nondeterministic bottom-up finite tree automata and standard operations on them....

IN - Informatika

  • 2010
  • R
Result

Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata)

for an efficient size reduction of nondeterministic tree automata. This is of a very highWe address the problem of computing simulation relations over tree automata. In particular, we consider downward an...

JC - Počítačový hardware a software

  • 2008
  • D
Result

Reduction of Nondeterministic Tree Automata

We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning automata library, and tested its performance on a given ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2016
  • D
  • Link
Result

Nondeterministic automata

A nondeterministic version of a finite automata is studied in the paper. A nondeterministic version of a finite automata is studied in the paper....

BA - Obecná matematika

  • 2015
  • D
Result

Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

We propose new antichain-based algorithms for
checking universality and inclusion of nondeterministic tree automata (NTA).
We have
implemented tree
model checking framework based entirely on NTA. We

JC - Počítačový hardware a software

  • 2008
  • D
Result

Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

of nondeterministic tree automata (NTA).  We have implemented these algorithms in a prototype checking algorithm to build an abstract regular tree model checking framework based tree-shaped data stru...

JC - Počítačový hardware a software

  • 2008
  • A
Result

Simulations and Aintichains for Efficient Handling of Tree Automata

in practice, with the main emphasis on nondeterministic tree automata. This concerns problems that arecrucial for many applications of tree automata. For size reduction of tree automata,...

IN - Informatika

  • 2010
  • B
Result

"Determinization" of nondeterministic finite automaton

The paper deals with a conditional character of a determinization of nondeterministic automata...

JC - Počítačový hardware a software

  • 2013
  • O
Result

Subtree Matching by Pushdown Automata

of subtree pattern matchers by deterministic pushdown automata, which read subject trees to the construction of string pattern matchers: for a given pattern, a nondeterministic pushdown of the resulting deterministic pushd...

IN - Informatika

  • 2010
  • Jx
Result

When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata)

We describe a new and more efficient algorithm for checking universality
and language inclusion on nondeterministic finite word automata (NFA)
and tree automata (TA). To the best of our knowledge, the anticha...

IN - Informatika

  • 2010
  • D
  • 1 - 10 out of 17 794