Prefix-free languages: left and right quotient and reversal

DOI10.1016/j.tcs.2015.08.031zbMath1338.68151OpenAlexW2411905925MaRDI QIDQ896681

N. E. Zubov

Publication date: 10 December 2015

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

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

zbMATH Keywords

minimizationregular languagefinite automatastate complexitydeterminizationreversalleft quotientprefix-free languageright quotient

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Nondeterministic operational complexity in subregular languages ⋮ Power, positive closure, and quotients on convex languages ⋮ Kuratowski Algebras Generated by Prefix-Free Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State complexity of union and intersection of star on \(k\) regular languages
• Reversal of binary regular languages
• On the state complexity of reversals of regular languages
• Succinct representation of regular languages by Boolean automata
• The state complexities of some basic operations on regular languages
• State Complexity of Combined Operations for Prefix-Free Regular Languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Cyclic Shift on Prefix-Free Languages
• IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES

This page was built for publication: Prefix-free languages: left and right quotient and reversal