Result 1 to 20 of 51 total
One-reversal counter machines and multihead automata: revisited. (English)
Theor. Comput. Sci. 454, 81-87 (2012).
1
Algorithmic decomposition of shuffle on words. (English)
Theor. Comput. Sci. 454, 38-50 (2012).
2
Relativized codes. (English)
Theor. Comput. Sci. 429, 54-64 (2012).
3
Theoretical and computational properties of transpositions. (English)
Nat. Comput. 10, No. 2, 795-804 (2011).
4
Orthogonal shuffle on trajectories. (English)
Int. J. Found. Comput. Sci. 22, No. 1, 213-222 (2011).
5
One-reversal counter machines and multihead automata: revisited. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 166-177 (2011).
6
One-reversal counter machines and multihead automata: revisited (English)
SOFSEM, 166-177 (2011).
7
A relation by palindromic subwords. (English)
Nat. Comput. 9, No. 4, 935-954 (2010).
8
Orthogonal concatenation: language equations and state complexity. (English)
J. UCS 16, No. 5, 653-675, electronic only (2010).
9
Modelling programmed frameshifting with frameshift machines. (English)
Nat. Comput. 9, No. 1, 239-261 (2010).
10
On the shuffle automaton size for words. (English)
Comput. Res. Repos. 2009, Article No. 0907.5111 (2009).
11
State complexity of orthogonal catenation. (English)
Comput. Res. Repos. 2009, Article No. 0904.3366 (2009).
12
On the uniqueness of shuffle on words and finite languages. (English)
Theor. Comput. Sci. 410, No. 38-40, 3711-3724 (2009).
13
The bag automaton: a model of nondeterministic storage. (English)
J. Autom. Lang. Comb. 13, No. 3-4, 185-206 (2008).
14
Computation by annotation: modelling epigenetic regulation. (English)
Int. J. Found. Comput. Sci. 19, No. 5, Part 1, 1087-1098 (2008).
15
On the processing power of protozoa. (English)
Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15‒20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 152-153 (2008).
16
A useful bounded resource functional language. (English)
Geffert, Viliam (ed.) et al., SOFSEM 2008: Theory and practice of computer science. 34th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 19‒25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77565-2/pbk). Lecture Notes in Computer Science 4910, 198-210 (2008).
17
No going back: an interactive visualization application for trailblazing on the web (English)
IV, 133-142 (2008).
18
State complexity of orthogonal catenation (English)
DCFS, 134-144 (2008).
19
A useful bounded resource functional language (English)
SOFSEM, 198-210 (2008).
20
Result 1 to 20 of 51 total
Start
Contact
Print
General Help
