On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)

DOI10.1016/j.tcs.2014.02.001zbMath1282.68155MaRDI QIDQ2437851

Olivier Ly, Zhilin Wu

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.001

zbMATH Keywords

regular languages; codes; language equations; one counter machine; pushdown games

Mathematics Subject Classification ID

91A80: Applications of game theory

68Q45: Formal languages and automata

Related Items

Weighted automata on infinite words in the context of attacker-defender games, Language equations, Weighted Automata on Infinite Words in the Context of Attacker-Defender Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on winning positions on pushdown games with \(\omega\)-regular conditions
• Conjugacy of finite biprefix codes
• Borel determinacy
• The commutation of finite sets: A challenging problem
• Commutation with ternary sets of words
• Conway's problem for three-word sets.
• Pushdown processes: Games and model-checking
• Commutation with codes
• Regular solutions of language inequalities and well quasi-orders
• The power of commuting with finite sets of words
• Codes et motifs
• Reachability Games on Extended Vector Addition Systems with States
• Developments in Language Theory
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture