Filters
Super-Turing Computational Potential of Cognitive and Evolutionary Systems.
of such automata are finite state automata, discrete neural networks, Boolean circuits, etc. It is shown that non-uniform families of cognitive automata and community of cognitive automata posses...
BA - Obecná matematika
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Question Answering by Humans and Machines: A Complexity-theoretic View
agents are modeled by means of cognitive automata, augmented with a form of background intelligence which gives the automata the possibility to query a given Turing the abilities of the other. In particular, polynomially b...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa.
The neuroidal tabula rasa (NTR) as a hypothetical device that is capable of performing tasks related to cognitive processes in the brain was introduced by L. G. Valiant in 1994. Neuroidal nets represent a computational model of the NTR. Thei...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Emergence of a Super-Turing Computational Potential in Artificial living Systems.
The artificial living systems are modeled by the so-called cognitive automaton that serves as a basic model of a single organism. It may be any device whose computational power is equivalent to a finite state automaton but which may work und...
BA - Obecná matematika
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Temporal Logic Robot Control based on Automata Learning of Environmental Dynamics
extend results in automata learning to detect patterns of the unknown behavior of the elements in the environment. Second, we employ an automata-theoretic method to generate......
IN - Informatika
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
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
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
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
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Determinism and fuzzy automata
The concept of determinism in fuzzy automata is investigated.
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
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
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
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
Rok uplatnění
B - Odborná kniha
- 1 - 10 out of 10 641