Author:
Blumensath Achim,Otto Martin,Weyer Mark
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Barwise, J., Moschovakis, Y.N.: Global inductive definability. The Journal of Symbolic Logic 43, 521–534 (1978)
2. Lecture Notes in Computer Science;T. Colcombet,2008
3. Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs. In: Proc. 20th Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 477–490 (1988)
4. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)
5. Hashiguchi, K.: Improved limitedness theorems on finite automata with distance functions. Theoretical Computer Science 72, 72–78 (1990)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-way cost automata and cost logics over infinite trees;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
2. Regular Cost Functions, Part I: Logic and Algebra over Words;Logical Methods in Computer Science;2013-08-13
3. Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory;2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science;2013-06
4. Regular Cost Functions over Finite Trees;2010 25th Annual IEEE Symposium on Logic in Computer Science;2010-07
5. Regular Temporal Cost Functions;Automata, Languages and Programming;2010