The range of state complexities of languages resulting from the cut operation
From MaRDI portal
Publication:2278275
DOI10.1007/978-3-030-13435-8_14zbMath1425.68206OpenAlexW2913032954MaRDI QIDQ2278275
Michal Hospodár, Markus Holzer
Publication date: 4 December 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_14
Related Items (10)
Operations on Permutation Automata ⋮ The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) ⋮ The cut operation in subclasses of convex languages (extended abstract) ⋮ The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case ⋮ 2D oxide picture languages and their properties ⋮ The cut operation in subclasses of convex languages ⋮ Operational complexity: NFA-to-DFA trade-off ⋮ More on the descriptional complexity of products of finite automata ⋮ Closure properties of subregular languages under operations ⋮ The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
This page was built for publication: The range of state complexities of languages resulting from the cut operation
