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 386 (0,177s)

Result

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata

We study proper languages of (strongly) lexicalized FRR-automata, which are a theoretical model for the analysis by reduction that is used in structural analysis of (natural) languages....

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

  • 2008
  • D
Result

On PCGS and FRR-automata

Abstract. This paper presents the second part of the technical report [7] in which the study of the relation between Parallel Communicating Grammar Systems (PCGS) and Freely Rewriting Restarting Automata (FRR) has been initiated. Th...

BA - Obecná matematika

  • 2008
  • D
Result

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata

such phenomena. We study proper languages of deterministic FRR-automata that are (strongly disambiguation. Here we present the freely rewriting restarting automaton (FRR- utomaton......

BA - Obecná matematika

  • 2009
  • Jx
Result

On the Correspondence between Parallel Communicating Grammar Systems and Restarting Automata

This chapter presents a study of the relationship between Parallel Communicating Grammar Systems (PCGS) and Freely Rewriting Restarting Automata (FRR). The authors introduce and study the so-called distribution complexity and the ge...

IN - Informatika

  • 2011
  • C
Result

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the linguistic method of analysis by reduction. For PCGS we s...

BA - Obecná matematika

  • 2009
  • D
Result

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, which are obtained from returning regular parallel communicating grammar systems by restricting the derivations that are executed in parallel by the variou...

IN - Informatika

  • 2011
  • Jx
  • Link
Result

Evaluation of Bit String Fast Reroute Mechanism

describes an evaluation of the modern Fast ReRoute (FRR) mechanism Bit-Repair (B-REP) that uses the Bit-String field to define hop-by-hop an alternative backup FRR path......

Electrical and electronic engineering

  • 2022
  • D
  • Link
Result

BioFinger - Evaluation of biometric systems (Fingerprint Technology)

This publication is the final report of the BioFinger projects. At the beginning the functionality of fingerprint recognition systems is described. Follows the description of errors, which are intended for general biometric systems (e.g. FAR, FRR...

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

  • 2004
  • Vx
Result

Biometric Authentication Using the Unique Characteristics of the ECG Signal

an average false acceptance rate (FAR) 7.11% and false rejection rate (FRR) 6.49%. The second method reached FAR 6.96% and FRR 21.61%. The third method reached FAR 0.57% and FRR 0.00%....

Medical engineering

  • 2020
  • D
  • Link
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
  • 1 - 10 out of 1 386