Infinity problems and countability problems for \(\omega \)-automata (Q845856): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077572182 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ω-Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2769034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Space-bounded reducibility among combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3214824 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4035346 / rank | |||
Normal rank | |||
Latest revision as of 10:57, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinity problems and countability problems for \(\omega \)-automata |
scientific article |
Statements
Infinity problems and countability problems for \(\omega \)-automata (English)
0 references
29 January 2010
0 references
formal languages
0 references
\(\omega \)-automaton
0 references
cardinality
0 references
complexity
0 references
