Why These Automata Types?

From MaRDI portal

Revision as of 18:04, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5222950

Jump to:navigation, search

DOI10.29007/c3bjzbMath1415.68122OpenAlexW2907581921MaRDI QIDQ5222950

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

automata Boolean operations succinctness omega-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Regular model checking with regular relations ⋮ Zielonka DAG acceptance and regular languages over infinite words ⋮ Unnamed Item ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ On the translation of automata to linear temporal logic ⋮ Quantitative vs. weighted automata ⋮ Approximate Automata for Omega-Regular Languages ⋮ Generic Emptiness Check for Fun and Profit

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5222950&oldid=19833202"