Automata Presenting Structures: A Survey of the Finite String Case

E-ISSN： 1943-5894|14|2|169-209

ISSN： 1079-8986

Source： Bulletin of Symbolic Logic, Vol.14, Iss.2, 2008-06, pp. : 169-209

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Finite Presentations of Infinite Structures: Automata and Interpretations

By Blumensath Achim

Theory of Computing Systems, Vol. 37, Iss. 6, 2004-12 ,pp. : 641-674

Springer Publishing Company

Access to resources Recommend Favorite

Comparing Verboseness for Finite Automata and Turing Machines

By Tantau Till

Theory of Computing Systems, Vol. 37, Iss. 1, 2004-01 ,pp. : 95-109

Springer Publishing Company

Access to resources Recommend Favorite

Finite state automata and monadic definability of singular cardinals

The Journal of Symbolic Logic, Vol. 73, Iss. 2, 2008-06 ,pp. : 412-438

Cambridge University Press

Access to resources Recommend Favorite

A Finite Field Framework for Modeling, Analysis and Control of Finite State Automata

By Reger Johann Schmidt Klaus

Mathematical and Computer Modelling of Dynamical Systems, Vol. 10, Iss. 3-4, 2004-09 ,pp. : 253-285

Taylor & Francis Ltd

Access to resources Recommend Favorite

Comparing Classes of Finite Structures

By Calvert W. Cummins D. Knight J. F. Miller S.

Algebra and Logic, Vol. 43, Iss. 6, 2004-11 ,pp. : 374-392

Springer Publishing Company

Access to resources Recommend Favorite