Result 1 to 12 of 12 total
Type-based homeomorphic embedding for online termination. (English)
Inf. Process. Lett. 109, No. 15, 879-886 (2009).
1
Well quasi-orders in formal language theory. (English)
Ito, Masami (ed.) et al., Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85779-2/pbk). Lecture Notes in Computer Science 5257, 84-95 (2008).
2
Well quasi-orders generated by a word-shuffle rewriting. (English)
Theor. Comput. Sci. 377, No. 1-3, 73-92 (2007).
3
Well quasi-orders, unavoidable sets, and derivation systems. (English)
Theor. Inform. Appl. 40, No. 3, 407-426 (2006).
4
Well quasi-orders and context-free grammars. (English)
Theor. Comput. Sci. 327, No. 3, 255-268 (2004).
5
Homeomorphic embedding for online termination of symbolic methods. (English)
Mogensen, Torben Æ. (ed.) et al., The essence of computation. Complexity, analysis, transformation. Essays dedicated to Neil D. Jones. Berlin: Springer. Lect. Notes Comput. Sci. 2566, 379-403 (2002).
6
On better-quasi-ordering countable series-parallel orders. (English)
Trans. Am. Math. Soc. 352, No.6, 2491-2505 (2000).
7
On the regularity of languages on a binary alphabet generated by copying systems. (English)
Inf. Process. Lett. 44, No.3, 119-123 (1992).
8
Algorithmic aspects of ordered structures. (English)
Berlin: Technische Universität, Fachbereich Mathematik, 79 p. (1992).
9
Using unavoidable set of trees to generalize Kruskal’s theorem. (English)
J. Symb. Comput. 8, No.4, 335-382 (1989).
10
On regularity of context-free languages. (English)
Theor. Comput. Sci. 27, 311-332 (1983).
11
Basic formulas and languages. I: The theory. (English)
Discrete Appl. Math. 3, 235-255 (1981).
12
Result 1 to 12 of 12 total
Start
Contact
Print
General Help
