Somewhat finite approaches to infinite sentences.
From MaRDI portal
Publication:1353892
DOI10.1007/BF02451547zbMath1034.68553OpenAlexW1975315605MaRDI QIDQ1353892
Publication date: 11 May 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02451547
Cites Work
- Unnamed Item
- Unnamed Item
- Automata-theoretic techniques for modal logics of programs
- An introduction to the regular theory of fairness
- On the complexity of \(\omega\)-type Turing acceptors
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
- \(\omega\)-computations on Turing machines
- \(\omega\)-computations on deterministic pushdown machines
- Infinite behaviour of Petri nets
- A combinatorial approach to the theory of ω-automata
- A note on asymmetry in phrase structure grammars
- One-way stack automata
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
- On Computable Numbers, with an Application to the Entscheidungsproblem
This page was built for publication: Somewhat finite approaches to infinite sentences.
