Automata on infinite objects and their applications to logic and programming
From MaRDI portal
Publication:582913
Recommendations
- scientific article; zbMATH DE number 3982544
- Topological characterizations of infinite tree languages
- scientific article; zbMATH DE number 475420
- On automata on infinite trees
- scientific article; zbMATH DE number 4096786
- scientific article; zbMATH DE number 2086519
- Uniform inevitability is tree automaton ineffable
- PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
Cites work
- scientific article; zbMATH DE number 3983141 (Why is no real title available?)
- scientific article; zbMATH DE number 3658971 (Why is no real title available?)
- scientific article; zbMATH DE number 3709584 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3790415 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3999901 (Why is no real title available?)
- scientific article; zbMATH DE number 3445172 (Why is no real title available?)
- scientific article; zbMATH DE number 1456950 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- A note on \(\omega\)-regular languages
- Algorithm = logic + control
- Alternation
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding full branching time logic
- Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
- Definability in dynamic logic
- Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
- First-order dynamic logic
- Formal computations of non deterministic recursive program schemes
- Fundamental properties of infinite trees
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Infinitary tree languages recognized by \(\omega\)-automata
- Pushdown tree automata
- Testing and generating infinite sequences by a finite automaton
- The greatest fixed-points and rational omega-tree languages
- The minimalization of tree automata
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Theory of -languages. II: A study of various models of - type generation and recognition
Cited in
(27)- scientific article; zbMATH DE number 1670767 (Why is no real title available?)
- Variétés d'automates descendants d'arbres infinis
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata
- scientific article; zbMATH DE number 475418 (Why is no real title available?)
- Infinite trees and automaton-definable relations over -words
- scientific article; zbMATH DE number 3982544 (Why is no real title available?)
- scientific article; zbMATH DE number 3983141 (Why is no real title available?)
- scientific article; zbMATH DE number 2086519 (Why is no real title available?)
- scientific article; zbMATH DE number 4035187 (Why is no real title available?)
- Profinite Methods in Automata Theory
- scientific article; zbMATH DE number 49206 (Why is no real title available?)
- Automata theory and its applications
- Infinitary tree languages recognized by \(\omega\)-automata
- scientific article; zbMATH DE number 1678376 (Why is no real title available?)
- Finite automata in the mathematical theory of programming
- Topological characterizations of infinite tree languages
- On automata on infinite trees
- Weak Muller acceptance conditions for tree automata
- Parallel generation of infinite images
- A branching time logic with past operators
- scientific article; zbMATH DE number 3976378 (Why is no real title available?)
- Generalized automata on infinite trees and Muller-McNaughton's theorem
- Automata and logics over finitely varying functions
- scientific article; zbMATH DE number 4119651 (Why is no real title available?)
- scientific article; zbMATH DE number 475420 (Why is no real title available?)
- scientific article; zbMATH DE number 3972187 (Why is no real title available?)
- Automata and semigroups recognizing infinite words
This page was built for publication: Automata on infinite objects and their applications to logic and programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582913)