Why These Automata Types?
From MaRDI portal
Publication:5222950
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
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)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Title not available (Why is that?)
- Approximate automata for omega-regular languages
- Half-positional objectives recognized by deterministic Büchi automata
- On the (in)succinctness of Muller automata
- Regular model checking with regular relations
- Generic emptiness check for fun and profit
- Automated Technology for Verification and Analysis
- Zielonka DAG acceptance and regular languages over infinite words
- Synthesis with privacy against an observer
- Quantitative vs. weighted automata
- TYPENESS FOR ω-REGULAR AUTOMATA
- On the translation of automata to linear temporal logic
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)
