论文信息 - Automata on ordinals and automaticity of linear orders - 字舞流文

Automata on ordinals and automaticity of linear orders

Philipp Schlicht | Frank Stephan | F. Stephan | Philipp Schlicht

[1] S. Sieber. On a decision method in restricted second-order arithmetic , 1960 .

[2] Yaacov Choueka. Finite Automata, Definable Sets, and Regular Expressions over omega^n-Tapes , 1978, J. Comput. Syst. Sci..

[3] J. R. Büchi. On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[4] Anil Nerode,et al. Automatic Presentations of Structures , 1994, LCC.

[5] Olivier Carton. Accessibility in Automata on Scattered Linear Orderings , 2002, MFCS.

[6] C. Delhommé. Automaticité des ordinaux et des graphes homogènes , 2004 .

[7] Frank Stephan,et al. Automatic linear orders and trees , 2005, TOCL.

[8] Véronique Bruyère,et al. Automata on linear orderings , 2007, J. Comput. Syst. Sci..

[9] B. Khoussainov,et al. Logic Colloquium 2007: Three lectures on automatic structures , 2008, 0809.3430.

[10] Philipp Schlicht,et al. Automata on Ordinals and Linear Orders , 2011, CiE.

[11] Alexander Moshe Rabinovich,et al. Interpretations in Trees with Countably Many Branches , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[12] Markus Lohrey,et al. Tree-Automatic Well-Founded Trees , 2012, CiE.