Iterating Inverse Binary Transducers
暂无分享,去创建一个
[1] Anil Nerode,et al. Automatic Presentations of Structures , 1994, LCC.
[2] Anil Nerode,et al. Automata theory and its applications , 2001 .
[3] N. S. Barnett,et al. Private communication , 1969 .
[4] David B. A. Epstein,et al. Word processing in groups , 1992 .
[5] S. Sidki,et al. Groups: Automorphisms of the binary tree: state-closed subgroups and dynamics of 1/2-endomorphisms , 2004 .
[6] Klaus Sutner,et al. Invertible Transducers, Iteration and Coordinates , 2013, CIAA.
[7] Jacques Sakarovitch,et al. Elements of Automata Theory , 2009 .
[8] Jean Vuillemin,et al. On Circuits and Numbers , 1994, IEEE Trans. Computers.
[9] George N. Raney,et al. Sequential Functions , 1958, JACM.
[10] J. Howard Johnson. Rational Equivalence Relations , 1986, ICALP.
[11] V. Glushkov. THE ABSTRACT THEORY OF AUTOMATA , 1961 .
[12] Said Sidki,et al. Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity , 2000 .
[13] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[14] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.
[15] Jacques Sakarovitch,et al. Radix enumeration of rational languages , 2010, RAIRO Theor. Informatics Appl..
[16] Fernando Q. Gouvêa,et al. P-Adic Numbers: An Introduction , 1993 .
[17] Sasha Rubin,et al. Automatic Structures: Overview and Future Directions , 2003, J. Autom. Lang. Comb..
[18] Jorge E. Mezei,et al. On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..
[19] Volodymyr Nekrashevych,et al. Self-Similar Groups , 2005, 2304.11232.
[20] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[21] Laurent Bartholdi,et al. Groups defined by automata , 2010, Handbook of Automata Theory.
[22] Berndt Farwer,et al. ω-automata , 2002 .