scientific article; zbMATH DE number 512866

zbMath0799.68127MaRDI QIDQ4281563

Thomas Wilke

Publication date: 10 March 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilityinfinite wordslocally threshold testable \(\omega\)- languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Related Items

Refuting learning revisited., Level two of the quantifier alternation hierarchy over infinite words, On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases, Level Two of the Quantifier Alternation Hierarchy over Infinite Words, Reducing the time complexity of testing for local threshold testability, Expressive power of existential first-order sentences of Büchi's sequential calculus, A Generalization of Semenov’s Theorem to Automata over Real Numbers, A generalization of Cobham's theorem to automata over real numbers, Logic, semigroups and automata on words