Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages

DOI10.1007/978-3-319-09704-6_20zbMath1416.68099OpenAlexW88756883MaRDI QIDQ5496191

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)

Related Items (7)

Nondeterministic complexity of operations on free and convex languages ⋮ Nondeterministic operational complexity in subregular languages ⋮ A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity ⋮ Power, positive closure, and quotients on convex languages ⋮ Nondeterministic Complexity of Operations on Closed and Ideal Languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Complement on Free and Ideal Languages

This page was built for publication: Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages