Andere Kunden interessierten sich auch für
![Theorem Provers in Circuit Design: Theory, Practice and Experience]( "Theorem Provers in Circuit Design: Theory, Practice and Experience")
Theorem Provers in Circuit Design: Theory, Practice and Experience40,99 €![Types for Proofs and Programs]( "Types for Proofs and Programs")
Types for Proofs and Programs40,99 €![5th Conference on Automated Deduction]( "5th Conference on Automated Deduction")
5th Conference on Automated Deduction40,99 €![Typed Lambda Calculi and Applications]( "Typed Lambda Calculi and Applications")
Typed Lambda Calculi and Applications39,99 €![Theorem Proving in Higher Order Logics]( "Theorem Proving in Higher Order Logics")
Theorem Proving in Higher Order Logics39,99 €![Developments in Language Theory]( "Developments in Language Theory")
Developments in Language Theory40,99 €![Extensional Constructs in Intensional Type Theory]( "Extensional Constructs in Intensional Type Theory")
Extensional Constructs in Intensional Type Theory103,99 €
An introduction to finite automata on infinite words.- Deterministic and non ambiguous rational ?-languages.- Ensembles reconnaissables de mots bi-inpinis Limite et d¿rminisme.- Automates boustrophedon sur des mots infinis.- Star-free ?-languages and first order logic.- A formal proof system for infinitary rational expressions.- Logical formulas and four subclasses of ?-regular languages.- Deterministic asynchronous automata.- Alternating automata on infinite objects, determinacy and Rabin's theorem.- The solution of two star-height problems for regular trees.- Decidability of yield's equality for infinite regular trees.- Languages and subshifts.- The adherences of languages as topological spaces.- Mots infinis en arithmetique.- Kth power-free codes.- On various classes of infinite words obtained by iterated mappings.- Overlap free words on two symbols.- Overlap-free sequences.