You have Guest access.
Log In
Klaus Reinhardt
Book Chapter
Weak Cardinality Theorems for First-Order Logic (Extended Abstract)
Till Tantau
Lecture Notes in Computer Science, 2003, Volume 2751, Fundamentals of Computation Theory, Pages 1031-1044
Automata and Turing Machines
Maribel Fernández
Undergraduate Topics in Computer Science, 2009, Models of Computation, Part I, Pages 11-32
How to Fix It: Using Fixpoints in Different Contexts
Franz Baader and Andrei Voronkov
Lecture Notes in Computer Science, 2005, Volume 3452, Logic for Programming, Artificial Intelligence, and Reasoning, Pages 184-193
Foundations of Computer Science and Mathematics
Texts in Theoretical Computer Science. An EATCS Series, 2005, Complexity Theory and Cryptology, Pages 9-52
Theories of Automatic Structures and Their Complexity
Dietrich Kuske
Lecture Notes in Computer Science, 2009, Volume 5725, Algebraic Informatics, Pages 81-98
Quantum Finite Automata and Logics
Ilze Dzelme
Lecture Notes in Computer Science, 2006, Volume 3831, SOFSEM 2006: Theory and Practice of Computer Science, Pages 246-253
On Rational Trees
Arnaud Carayol and Christophe Morvan
Lecture Notes in Computer Science, 2006, Volume 4207, Computer Science Logic, Pages 225-239
Comparing Verboseness for Finite Automata and Turing Machines
Lecture Notes in Computer Science, 2002, Volume 2285, STACS 2002, Page 730
Nested Pebbles and Transitive Closure
Joost Engelfriet and Hendrik Jan Hoogeboom
Lecture Notes in Computer Science, 2006, Volume 3884, STACS 2006, Pages 477-488
Traces, Series-Parallel Posets, and Pictures: A Weighted Study
Ina Fichtner, Dietrich Kuske and Ingmar Meinecke
Monographs in Theoretical Computer Science. An EATCS Series, 2009, Handbook of Weighted Automata, Part 3, Pages 405-450
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info