Filters
Complexity of Evolving Interactive Systems
We study a versatile model of evolving interactive computing: lineages of automata. A lineage consists of a sequence of interactive finite automata, with a mechanism of passing information from each automaton to it...
BA - Obecná matematika
- 2004 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Computing by Self-Reproduction: Autopoietic Automata
program. We show that the computational power of lineages of autopoietic automataWe introduce a new formal computational model designed for studying the information transfer among the generations of offspring-producing machines - s...
IN - Informatika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Large Language Models and the Extended Church-Turing Thesis
the theory of automata. Along these lines, we establish a number of fundamental results-bounded Turing machines by LLMs. Secondly, we show that lineages of evolving LLMs confirms the validity of the ECTT for lineages of LL...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2024 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes
processes. We show that the computational power of lineages of autopoietic automata-called autopoietic automata. These can be seen as nondeterministic finite state is a modification of its parent?s program. Autopoietic
IN - Informatika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
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
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
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 4 377