scientific article; zbMATH DE number 1500643
From MaRDI portal
Publication:4501665
zbMATH Open0961.68074MaRDI QIDQ4501665FDOQ4501665
Authors: Christof Löding 
Publication date: 7 November 2000
Title of this publication is not available (Why is that?)
Recommendations
Cited In (23)
- On Repetition Languages
- Automata theory and model checking
- \(\omega \)-automata
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
- Structural complexity of \(\omega\)-automata
- Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
- Modular mix-and-match complementation of Büchi automata
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- Title not available (Why is that?)
- A theory of ultimately periodic languages and automata with an application to time granularity
- A tighter analysis of Piterman's Büchi determinization
- An impossibility result in automata-theoretic reinforcement learning
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Index appearance record for transforming Rabin automata into parity automata
- Rabin vs. Streett automata
- Zielonka DAG acceptance and regular languages over infinite words
- Stochastic games with lexicographic objectives
- Observations on determinization of Büchi automata
- Index appearance record with preorders
- Practical applications of the alternating cycle decomposition
- On the translation of automata to linear temporal logic
- Multi-Valued Reasoning about Reactive Systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501665)
