Implementation and Application of Automata

DOI10.1007/11605157MaRDI QIDQ5897682zbMATH OpenOpenAlexFDO

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)

• Linear temporal logic -- from infinite to finite horizon
• scientific article; zbMATH DE number 1670861 (Why is no real title available?)
• Automata transformations of prefix decidable and decidable by Buchi superwords
• New optimizations and heuristics for determinization of Büchi automata
• A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
• Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
• From LTL to Symbolically Represented Deterministic Automata
• Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
• A power-set construction for reducing Büchi automata to non-determinism degree two
• Experiments with deterministic -automata for formulas of linear temporal logic
• A tighter analysis of Piterman's Büchi determinization

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)