On Repetition Languages

DOI10.4230/LIPICS.MFCS.2020.59MaRDI QIDQ5089230zbMATH OpenOpenAlexFDO

Authors Orna Kupferman, Ofer Leshkowitz

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPIcs.MFCS.2020.59

zbMATH Keywords

succinctnessexpressive powerBüchi automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 475417 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1500643 (Why is no real title available?)
• scientific article; zbMATH DE number 1555955 (Why is no real title available?)
• scientific article; zbMATH DE number 3999901 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3339435 (Why is no real title available?)
• Automata theory and model checking
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decision problems forω-automata
• From linear time to branching time
• Graph Games and Reactive Synthesis
• Model checking probabilistic systems
• On the Succinctness of Nondeterminism
• Promptness in \(\omega \)-regular automata
• Reasoning about infinite computations
• Testing and generating infinite sequences by a finite automaton

Cited in

(2)

• Minimization of automata for liveness languages
• Repeating and remembering foreign language words: Implications for language teaching systems

This page was built for publication: On Repetition Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089230)