scientific article; zbMATH DE number 6741931

zbMath1367.03074MaRDI QIDQ5271416

Christof Löding, Arnaud Carayol

Publication date: 11 July 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

undecidabilityuniformizationsautomaton definable functionsautomaton definable relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05)

Related Items

Unnamed Item, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Unnamed Item, On computability of data word functions defined by transducers, Synthesis of deterministic top-down tree transducers from automatic tree relations, Unnamed Item, How Much Lookahead is Needed to Win Infinite Games?, How Much Lookahead is Needed to Win Infinite Games?