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

Automata on infinite trees with counting constraints

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

DOI10.1006/inco.1995.1104zbMath0835.68081OpenAlexW2057967675MaRDI QIDQ1898484

Danièle Beauquier, Damian Niwinski

Publication date: 16 April 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1104

zbMATH Keywords

Muller automatafinite automata on infinite trees


Mathematics Subject Classification ID

Formal languages and automata (68Q45)


Related Items

Randomization in Automata on Infinite Trees, Counting branches in trees using games



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