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

1 369 (0,077s)

Result

Monadic automata with relational morphisms

Categories of monadic automata and monadic automata with inpu-output objects are introduced where morphisms between automata are relations defined by monads. These categories with relational morphisms include most known

Applied mathematics

  • 2021
  • D
  • Link
Result

Semigroup homomorphism and fuzzy automata

A generalized W-fuzzy automata over a complete residuated lattice and a monoid of these generalized fuzzy automata is investigated. It is proved that clasiccal automata, classical fuzzy automata and nondeterministi...

BB - Aplikovaná statistika, operační výzkum

  • 2002
  • Jx
Result

Determinism and fuzzy automata

The concept of determinism in fuzzy automata is investigated.

BA - Obecná matematika

  • 2002
  • Jx
Result

Seminator: A Tool for Semi-Determinization of Omega-Automata

We present a tool that transforms nondeterministic omega-automata to semi-deterministic omega-automata. The tool Seminator accepts transition-based generalized Büchi automata (TGBA) as an input and produces automata

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

  • 2017
  • D
  • Link
Result

Simulations and Aintichains for Efficient Handling of Tree Automata

This work is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns problems that arecrucial for many applications of tree automata. For ...

IN - Informatika

  • 2010
  • B
Result

Learning Automata

The paper deals with finite stochastic automata and particulary their special form - finite reinforcement learning automata with so called a variable structure....

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

  • 2012
  • Jx
Result

Jumping Finite Automata

The present paper proposes a new investigation area in automata theory: jumping finite automata. These automata work like classical finite automata except there. The paper establishes several results concerning jum...

IN - Informatika

  • 2012
  • Jx
  • Link
Result

Quantum finite automata

Detailed and systematic analysis of quantum automata models. Comparison with classical finite automata.

IN - Informatika

  • 2006
  • Jx
Result

Promise problems solved by quantum and classical finite automata

Analysis of performance of quantum automata and classical automata...

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

  • 2017
  • Jimp
  • Link
Result

Finite automata realisation

The paper is dealing with the synthesis and realisation on finite automata by means of homomorphims and isomorphism of automata.

BA - Obecná matematika

  • 2013
  • D
  • 1 - 10 out of 1 369