Filters
On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching
a synchronizing term and a k-local deterministic finite bottom–up tree automaton. Furthermore of the deterministic k-local tree automaton in O(log n) time with [n/ log n] processors, for k
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Alternative Automata Characterization of Piecewise Testable Languages
We present a transparent condition on a minimal automaton which is equivalent the original Simon?s condition on the minimal automaton in a different way than conditions of Stern and Trahtman. Secondly, we prove that every piecewise ...
BA - Obecná matematika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On Parallel Implementations of Deterministic Finite Automata
from k-locality that allows optimum parallel run of exact and approximate pattern of states vertical bar Q vertical bar of automaton being run, they are suitable only......
IN - Informatika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Simulation of LLk Parsers with Wide Context by Automaton with One-Symbol Reading Head
and, in addition, there are problems with analysis of the
LL(k+1), k>=1, grammars. This paper presents algorithm that allows transformation
from pushdown automaton with (k+1)-symbol reading head used fo...
JC - Počítačový hardware a software
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
A cellular automaton-based formulation of non-local damage mechanics
The strain-softening localization problems have been studied intensely using a number of methods to avoid strain localization. This paper addresses a theoretical exploration of another model based on cellular automaton as a...
JM - Inženýrské stavitelství
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
On localization of (post)prefix (in)consistencies
A reducing automaton (red-automaton) is a deterministic automaton proposed for checking word and sub-word correctness by the use of analysis by reduction, see [3, 4 transducer for any monotone reducing automaton wh...
IN - Informatika
- 2012 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
of automaton A. If the given automaton is local, and therefore the language it accepts is strictly locally testable, the sets of its shortest characteristic factors are finite. We showcase the computation of the p...
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
Constrained Approximate Subtree Matching by Finite Automata
finite automaton finds all occurrences in time O(n) and has O(|A|^k m^(k+1)) statesProcessing tree data structures usually requires a pushdown automaton as a model of computation. Therefore, it is interesting that...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Multilayer Cellular Automaton Model for Pedestrian Dynamics
The multilayer cellular automaton (CA) model is based on the two dimensional cellular automaton introduced in the article BURSTEDDE, C., KLAUCK K., SCHADSCHNEIDER A., ZITTARTZ J., ?Simulation of pedestrian dynamics using a ...
IN - Informatika
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Localization of (in)consistencies by monotone reducing automata
A reducing automaton (red-automaton) is a deterministic automaton proposed of any monotone reducing automaton which is able with the help of special auxiliary symbols to localize its pre?x and post-pre?x (...
IN - Informatika
- 2012 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 77 072