Home > Search Results: keywords:"pevný bod"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 12 records found  previous11 - 12  jump to record: Search took 0.01 seconds. 
Algorithm for word morphisms fixed points
 Matocha, Vojtěch ; Holub, Štěpán (advisor) ; Žemlička, Jan (referee)
In the present work we study the first polynomial algorithm, which tests if the given word is a fixed point of a nontrivial morphism. This work contains an improved worst-case complexity estimate O(m · n) where n denotes the word length and m denotes the size of the alphabet. In the second part of this work we study the union-find problem, which is the crucial part of the described algorithm, and the Ackermann function, which is closely linked to the union-find complexity. We summarize several common methods and their time complexity proofs. We also present a solution for a special case of the union-find problem which appears in the studied algorithm. The rest of the work focuses on a Java implementation, whose time tests correspond to improved upper bound, and a visualization useful for particular entries.
Detailed record
The continuous and discrete logistic equation
 Ficza, Ildikó ; Opluštil, Zdeněk (referee) ; Čermák, Jan (advisor)
This bachelor's thesis deals with the continuous and discrete logistic equation. The objective of this thesis is to analyze these equations and compare both cases.
Detailed record

National Repository of Grey Literature : 12 records found   previous11 - 12  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English