Operational union-complexity

DOI10.1016/J.IC.2021.104692OpenAlexW3119468547MaRDI QIDQ2113386FDOQ2113386

Benedek Nagy

Publication date: 14 March 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104692

zbMATH Keywords

regular languagesregular operationsunion-complexityunion-free languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Second Course in Formal Languages and Automata Theory
• Transition Complexity of Incomplete DFAs
• Complexity in union-free regular languages
• Incomplete operational transition complexity of regular languages
• Algorithms for determining relative star height and star height
• On Union-Free and Deterministic Union-Free Languages
• Minimal Union-Free Decompositions of Regular Languages
• Most complex deterministic union-free regular languages
• On the Number of Accepting States of Finite Automata
• Title not available (Why is that?)
• On equations for union-free regular languages
• Structure and Complexity of Some Subregular Language Families
• Union-freeness, deterministic union-freeness and union-complexity
• The Ranges of Accepting State Complexities of Languages Resulting from Some Operations
• Isometries on positive operators of unit norm

Cited In (3)

• Union-complexities of Kleene plus operation
• Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages
• State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

This page was built for publication: Operational union-complexity

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