Why These Automata Types?

DOI10.29007/C3BJzbMATH Open1415.68122OpenAlexW2907581921MaRDI QIDQ5222950FDOQ5222950

Authors Udi Boker

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/c3bj

zbMATH Keywords

automataBoolean operationssuccinctnessomega-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3291143
• Typestates to automata and back: a tool
• Possibilities of various types of alternating automata
• Types from Frames as Finite Automata
• Verification, Model Checking, and Abstract Interpretation
• scientific article; zbMATH DE number 1263213
• What's decidable about hybrid automata?
• Publication:4934319
• scientific article; zbMATH DE number 1001512
• scientific article; zbMATH DE number 1944130

Cited in

(13)

• Regular model checking with regular relations
• Generic emptiness check for fun and profit
• On the (in)succinctness of Muller automata
• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 7649927 (Why is no real title available?)
• Approximate automata for omega-regular languages
• Zielonka DAG acceptance and regular languages over infinite words
• Half-positional objectives recognized by deterministic Büchi automata
• TYPENESS FOR ω-REGULAR AUTOMATA
• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
• On the translation of automata to linear temporal logic
• Synthesis with privacy against an observer
• Quantitative vs. weighted automata

This page was built for publication: Why These Automata Types?

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