Filters
Generalized and Weighted Strings: Repetitions and Pattern Matching
in generalized strings. Finally, we show how to transform the finite automaton for a givenGeneralized and weighted strings are special strings capable of expressing of strings are mainly used in molecular biology. In this ...
IN - Informatika
- 2004 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Weight-Reducing Hennie Machines and Their Descriptional Complexity
is compared with common devices that include the nondeterministic finite automa ton, two-way finite automaton and pebble automaton.We present a constructive variant of the Hennie machine. It is demonstrated how it...
JD - Využití počítačů, robotika a její aplikace
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Empty word and finite automaton
The paper defines the empty word and its properties and displays a posibility of its acceptance by finite automaton.
IN - Informatika
- 2015 •
- O
Rok uplatnění
O - Ostatní výsledky
Two-Way Coupled Finite Automaton and Its Usage in Translators
This article defines two-way coupled finite automata. A two-way coupled finite automaton enable us to make a translation from input language to output language and from output language to input language too. Deterministic p...
JC - Počítačový hardware a software
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
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 autom...
IN - Informatika
- 2012 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination
a finite tree automaton to an equivalent regular tree expression. Our algorithm finite automaton to an equivalent string regular expression. We define a generalised finite tree automaton, the tra...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D
Rok uplatnění
D - Stať ve sborníku
Causality and Finite Automaton
This paper is engaged in a relationship between the conditional probability, material imlication and causality and concerned with especially causality of states transitions into a finite automaton .No present literature deala with c...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jost
Rok uplatnění
Jost - Ostatní články v recenzovaných periodicích
One fast algorithm for finding automaton congruences
Even though congruences on a finite automaton play an important role when investigating the structure of a given automaton, not much attention has been given to finding a fast algorithm for constructing them. This contribut...
BA - Obecná matematika
- 2016 •
- D
Rok uplatnění
D - Stať ve sborníku
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
Given a deterministic finite automaton (DFA) A, we present a simple algorithm for constructing four deterministic finite automata that accept the shortest forbidden factors finite automaton, representing a...
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
Finite Automata Implementations Considering CPU Cache
The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used. It is usually trans...
IN - Informatika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 39 564