Decision Problems for Convex Languages

DOI10.1007/978-3-642-00982-2_21zbMath1234.68201arXiv0808.1928OpenAlexW1976140212MaRDI QIDQ3618584

Zhi Xu, Janusz A. Brzozowski, Jeffrey O. Shallit

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.1928

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Contractibility for open global constraints ⋮ Decision problems for convex languages ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ On NFAs where all states are final, initial, or both

Cites Work

• Decision problems for convex languages
• Computational Parallels between the Regular and Context-Free Languages
• INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decision Problems for Convex Languages