Result 1 to 20 of 137 total
The isomorphism problem for $ω$-automatic trees. (English)
Ann. Pure Appl. Logic 164, No. 1, 30-48 (2013).
1
Parameter reduction and automata evaluation for grammar-compressed trees. (English)
J. Comput. Syst. Sci. 78, No. 5, 1651-1669 (2012).
2
Tree-automatic well-founded trees. (English)
Cooper, S. Barry (ed.) et al., How the world computes. Turing centenary conference and 8th conference on computability in Europe, CiE 2012, Cambridge, UK, June 18‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30869-7/pbk). Lecture Notes in Computer Science 7318, 363-373 (2012).
3
Logspace computations in graph groups and Coxeter groups. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 243-254 (2012).
4
Model-checking hierarchical structures. (English)
J. Comput. Syst. Sci. 78, No. 2, 461-490 (2012).
5
The first-order theory of ground tree rewrite graphs. (English)
Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12‒14, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPICS ‒ Leibniz International Proceedings in Informatics 13, 276-287, electronic only (2011).
6
Automatic structures of bounded degree revisited. (English)
J. Symb. Log. 76, No. 4, 1352-1380 (2011).
7
Compressed word problems in HNN-extensions and amalgamated products. (English)
Theory Comput. Syst. 49, No. 2, 283-305 (2011).
8
Compressed word problems for inverse monoids. (English)
Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22‒26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 448-459 (2011).
9
Leaf languages and string compression. (English)
Inf. Comput. 209, No. 6, 951-965 (2011).
10
Isomorphism of regular trees and words. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 210-221 (2011).
11
Compressed membership in automata with compressed labels. (English)
Kulikov, Alexander (ed.) et al., Computer science ‒ theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14‒18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). Lecture Notes in Computer Science 6651, 275-288 (2011).
12
Isomorphism of regular trees and words. (English)
Comput. Res. Repos. 2011, Article No. 1102.2782 (2011).
13
Fixpoint logics over hierarchical structures. (English)
Theory Comput. Syst. 48, No. 1, 93-131 (2011).
14
Tilings and submonoids of metabelian groups. (English)
Theory Comput. Syst. 48, No. 2, 411-427 (2011).
15
Automatic structures of bounded degree revisited (English)
J. Symb. Log. 76, No. 4, 1352-1380 (2011).
16
Compressed membership in automata with compressed labels (English)
CSR, 275-288 (2011).
17
Isomorphism of regular trees and words (English)
ICALP (2), 210-221 (2011).
18
Compressed word problems for inverse monoids (English)
MFCS, 448-459 (2011).
19
Tree structure compression with repair (English)
DCC, 353-362 (2011).
20
Result 1 to 20 of 137 total
Start
Contact
Print
General Help
