Implementation and Application of Automata

DOI10.1007/11605157zbMATH Open1172.68490OpenAlexW2544597226MaRDI QIDQ5897682FDOQ5897682

Authors: Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier 

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11605157

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
• From LTL to Symbolically Represented Deterministic Automata
• Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic
• A power-set construction for reducing Büchi automata to non-determinism degree two
• Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
• A tighter analysis of Piterman's Büchi determinization
• Automata transformations of prefix decidable and decidable by Buchi superwords
• A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
• Linear temporal logic -- from infinite to finite horizon
• New Optimizations and Heuristics for Determinization of Büchi Automata
• Title not available (Why is that?)

This page was built for publication: Implementation and Application of Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897682)