All
All

What are you looking for?

All
Projects
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”
EN
ČeštinaEnglish

Filters

-
19912025

Join usingOrAnd

Join usingOrAnd

SelectAll/None

    • Show more

SelectAll/None

        • Show more

        • Show more

        • Show more

      • Show more

SelectAll/None

    • Show more

More filters

Results

1 829 results (0,394s) •

Result

Synchronizing Automata: Reset Strings and State Complexity

Dual problem is formulated to the shortest reset word of synchronizing automata. Some preliminary results are presented for slowly synchronizing automata and Kn,m automata....

IN - Informatika

  • 2012
    • •
  • D
Result

Firing and Resetting Characteristics of Carnivorous Utricularia reflexa Traps: Physiological or only Physical Regulation of Trap Triggering?

channels in animals, gradually and significantly decreased the trap resetting rates) added to partly reset traps did not influence the magnitude of the next firing but very markedly reduced the resetting rates to ca. 30 % ...

EF - Botanika

  • 2012
    • •
  • Jx
Result

Boundedness of Reset P/T Nets

Decidability of boundedness is studied for reset P/T nets.

BA - Obecná matematika

  • 1999
    • •
  • D
Result

An Extremal Series of Eulerian Synchronizing Automata

We present an infinite series of n-state Eulerian automata whose reset words have length at least (n(2) - 3)/2. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that (n(...

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

  • 2016
    • •
  • D
    • •
  • Link
Result

Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata

A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given length for a given automaton is known to be an N...

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

  • 2017
    • •
  • Jimp
    • •
  • Link
Result

Laparoscopic resetion of renal tumours

The authors present 21 laparoscopic resections of kidney tumours and that is compared with open resection.

FJ - Chirurgie včetně transplantologie

  • 2006
    • •
  • Jx
Result

Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata

A word is called a reset word for a deterministic finite automaton if it maps all states of the automaton to one state. Deciding about the existence of a reset word of given length for a given automaton is known to be a NP-complete ...

IN - Informatika

  • 2014
    • •
  • D
    • •
  • Link
Result

TCP Reset Attack

Based on some security problems in TCP/IP protocol design and newly discovered facts, pointed out by Paul A. Watson in his paper "Slipping in the Window: TCP reset attacks", we define conditions for implementing successful TCP reset...

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

  • 2005
    • •
  • D
Result

Complexity of Road Coloring with Prescribed Reset Words

By the Road Coloring Theorem (Trahtman, 2008), the edges of any given aperiodic directed multigraph with a constant out-degree can be colored such that the resulting automaton admits a reset word. There may also be a need for a particular

IN - Informatika

  • 2015
    • •
  • D
    • •
  • Link
Result

Subset Synchronization of Transitive Automata

We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton of compositionsequences initiated by Arto Salomaa, because reset words of subse...

IN - Informatika

  • 2014
    • •
  • O
    • •
  • Link
  • 1 - 10 out of 1 829