Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Why These Automata Types?

From MaRDI portal
Publication:5222950
Jump to:navigation, search

DOI10.29007/c3bjzbMath1415.68122OpenAlexW2907581921MaRDI QIDQ5222950

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)


Related Items

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5222950&oldid=19833202"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 19:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki