Connecting partial words and regular languages

DOI10.1007/978-3-642-30870-3_16MaRDI QIDQ2904404zbMATH OpenOpenAlexFDO

Authors Florin Manea, Robert Mercaş, Jürgen Dassow

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30870-3_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular languages of partial words
• On the language of primitive partial words
• Partial word DFAs
• Recurrent Partial Words and Representable Sets.
• On the Computational Complexity of Partial Word Automata Problems

Cited in

(3)

• On the language of primitive partial words
• Partial word DFAs
• Regular languages of partial words

This page was built for publication: Connecting partial words and regular languages

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