The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem
暂无分享,去创建一个
[1] Thomas Colcombet,et al. A Combinatorial Theorem for Trees , 2007, ICALP.
[2] James W. Thatcher,et al. Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.
[3] Daniel Kirsten,et al. Distance desert automata and the star height problem , 2005, RAIRO Theor. Informatics Appl..
[4] Thomas Colcombet,et al. Bounds in w-Regularity , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[5] Thomas Colcombet,et al. Bounds in ω-regularity , .
[6] Thomas Colcombet. A combinatorial theorem for trees applications to monadic logic and infinite structures , 2007 .
[7] Kosaburo Hashiguchi,et al. Algorithms for Determining Relative Star height and Star Height , 1988, IFIP Congress.
[8] John Doner,et al. Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..
[9] Christof Löding,et al. The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata , 2008, ICALP.
[10] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[11] Hubert Comon,et al. Tree automata techniques and applications , 1997 .
[12] L. Eggan. Transition graphs and the star-height of regular events. , 1963 .