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

19 282 (0,139s)

Result

Fuzzy Multiset Finite Automata: Determinism, Languages, and Pumping Lemma

accepted by both non-deterministic and deterministic fuzzy multiset finite automata.The concept of fuzzy multiset finite automata was introduced recently by Wang et al. in [14]. The idea is elabo...

IN - Informatika

  • 2015
  • D
  • Link
Result

The Finite Automata Approaches in Stringology

We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite ...

IN - Informatika

  • 2012
  • Jx
Result

Multiset languages accepted by deterministic multiset finite automata with detection as a specific kind of semilinear languages

accepted by deterministic multiset finite automata with detection.The class of multiset languages accepted by deterministic multiset finite automata with detection is strictly included in the cla...

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

  • 2017
  • D
  • Link
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

Deterministic forgetting planar automata are more powerful than nondeterministic finite state planar automata

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

  • 1998
  • Vx
Result

Some Notes to Minimization of Multiset Finite Automata

The paper deals with minimization of multiset finite automata. It is shown that in case of deterministic multiset finite automata whose transitions satisfy certain conditions based on lexicographic orderin...

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

  • 2018
  • D
  • Link
Result

On the Size of Deterministic Finite Automata

Not available...

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

  • 2002
  • D
Result

On the Size of Deterministic Finite Automata

Not available...

JD - Využití počítačů, robotika a její aplikace

  • 2001
  • D
Result

Repetitive Finite Automata With Translucent Letters

deterministic or nondeterministic finite automaton with translucent letters ( RDFAwtlHere we propose an extension of the (deterministic and the nondeterministic) finite automaton with translucent letters (DFAwtl a...

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

  • 2024
  • D
  • Link
Result

Deterministic Finite Automata for pattern matching in high speed networks

This paper deals with pattern matching in high speed networks using Deterministic Finite Automaton. We propose new method how to reduce transition table size in multichar automaton. The method is based on shared decoder, which is us...

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

  • 2008
  • D
  • 1 - 10 out of 19 282