Result 1 to 20 of 1084 total
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata. (English)
Rev. Inform. Teor. Apl. 43, No. 4, 779-790 (2009).
1
Dejean’s conjecture holds for $\sf {n\ge 27}$. (English)
Rev. Inform. Teor. Apl. 43, No. 4, 775-778 (2009).
2
A note on the number of squares in a partial word with one hole. (English)
Rev. Inform. Teor. Apl. 43, No. 4, 767-774 (2009).
3
Two extensions of system ${\mathsf F}$ with (co)iteration and primitive (co)recursion principles. (English)
Rev. Inform. Teor. Apl. 43, No. 4, 703-766 (2009).
4
Palindromes in infinite ternary words. (English)
Rev. Inform. Teor. Apl. 43, No. 4, 687-702 (2009).
5
On the proper intervalization of colored caterpillar trees. (English)
Rev. Inform. Teor. Apl. 43, No. 4, 667-686 (2009).
6
Left-to-right regular languages and two-way restarting automata. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 653-665 (2009).
7
Inductive computations on graphs defined by clique-width expressions. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 625-651 (2009).
8
Squares and cubes in Sturmian sequences. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 615-624 (2009).
9
Measuring the problem-relevant information in input. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 585-613 (2009).
10
Labeled shortest paths in digraphs with negative and positive edge weights. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 567-583 (2009).
11
Dynamic overloading with copy semantics in object-oriented languages: a formal account. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 517-565 (2009).
12
A game theoretical approach to the algebraic counterpart of the wagner hierarchy: part II. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 463-515 (2009).
13
A game theoretical approach to the algebraic counterpart of the wagner hierarchy: part I. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 443-461 (2009).
14
Episturmian words: a survey. (English)
Rev. Inform. Teor. Apl. 43, No. 3, 403-442 (2009).
15
Nested sibling tree automata. (English)
Rev. Inform. Teor. Apl. 43, No. 2, 379-402 (2009).
16
On context-free rewriting with a simple restriction and its computational completeness. (English)
Rev. Inform. Teor. Apl. 43, No. 2, 365-378 (2009).
17
Highly undecidable problems for infinite computations. (English)
Rev. Inform. Teor. Apl. 43, No. 2, 339-364 (2009).
18
Tree automata and automata on linear orderings. (English)
Rev. Inform. Teor. Apl. 43, No. 2, 321-338 (2009).
19
Directive words of episturmian words: equivalences and normalization. (English)
Rev. Inform. Teor. Apl. 43, No. 2, 299-319 (2009).
20
Result 1 to 20 of 1084 total
Start
Contact
Print
General Help
