Polynomial automaticity, context-free languages, and fixed points of morphisms (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 382-393

  Glaister, Ian ^a,b   Shallit, Jeffrey ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Array Systems Computing Inc   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS;

CLOSURE PROPERTY; DETERMINISTIC FINITE AUTOMATA; EXTENDED ABSTRACTS; FIXED POINTS; MORPHISMS; NONDETERMINISTIC POLYNOMIAL; NUMBER OF STATE;

CONTEXT FREE LANGUAGES;

EID: 21444438981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_164     Document Type: Conference Paper

References (11)

1. J. W. S. Cassels. An Introduction to Diophantine Approximation. Cambridge University Press, 1957.
2. A. Cobham. Uniform tag sequences. Math. Systems Theory 6 (1972), 164-192.
3. I. Glaister. Automaticity and closure properties. Master’s thesis, University of Waterloo, April 1995.
4. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford University Press, 1989.
5. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
6. J. Kaneps and R. Freivalds. Minimal nontrivial space complexity of probabilistic one-way Turing machines. In B. Rovan, editor, MFCS '90 (Mathematical Foundations of Computer Science), Vol. 452 of Lecture Notes in Computer Science, pages 355-361. Springer-Verlag, 1990.
7. C. Pomerance, J. M. Robson, and J. O. Shallit. Automaticity II: Descriptional complexity in the unary case. Submitted, 1994.
8. J. Shallit. Some facts about continued fractions that should be better known. Technical Report CS-91-30, University of Waterloo, Department of Computer Science, July 1991.
9. J. Shallit. Real numbers with bounded partial quotients: a survey. Enseign. Math. 38 (1992), 151-187.
10. J. Shallit and Y. Breitbart. Automaticity: Properties of a measure of descriptional complexity. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science, Vol. 775 of Lecture Notes in Computer Science, pages 619-630. Springer-Verlag, 1994.
11. J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. To appear, J. Comput. System Sci.