Complement on prefix-free, suffix-free, and non-returning NFA languages

DOI10.1007/978-3-319-09704-6_20MaRDI QIDQ5496191zbMATH OpenOpenAlexFDO

Authors Galina Jirásková, Peter Mlynárčik

Publication date 7 August 2014

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09704-6_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Complement on free and ideal languages
• Nondeterministic state complexity for suffix-free regular languages
• Nondeterministic complexity in subclasses of convex languages
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• On the State Complexity of Complements, Stars, and Reversals of Regular Languages

Cited in

(8)

• Power, positive closure, and quotients on convex languages
• Nondeterministic complexity in subclasses of convex languages
• Nondeterministic complexity of operations on free and convex languages
• Nondeterministic complexity of operations on closed and ideal languages
• Complement on free and ideal languages
• Nondeterministic operational complexity in subregular languages
• A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
• Regular languages in the sliding window model

This page was built for publication: Complement on prefix-free, suffix-free, and non-returning NFA languages

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