Sciweavers

14 search results - page 1 / 3
» Church's Problem and a Tour through Automata Theory
Sort
View
BIRTHDAY
2008
Springer
13 years 5 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
FOSSACS
2009
Springer
13 years 10 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
STACS
2009
Springer
13 years 10 months ago
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
Daniel Kirsten, Sylvain Lombardy
BIRTHDAY
2005
Springer
13 years 9 months ago
Fibring Logics: Past, Present and Future
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
Carlos Caleiro, Amílcar Sernadas, Cristina ...
LATA
2010
Springer
14 years 1 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...