Boundary sets of regular and context-free languages
type: Item
instance of: scholarly article
title: Boundary sets of regular and context-free languages
zbMATH Open document ID: 1332.68114
author: Markus Holzer
author: Sebastian Jakobi
published in: Theoretical Computer Science
publication date: 2015-12-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6519456
zbMATH Keywords: regular languages
zbMATH Keywords: context-free languages
zbMATH Keywords: boundary sets
zbMATH Keywords: computational complexity
zbMATH Keywords: decidability
zbMATH Keywords: valid computations
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.07.032
OpenAlex ID: W1955289261
cites work: Q5605131
cites work: Hyper-minimizing minimized deterministic finite state automata
cites work: On Minimising Automata with Errors
cites work: From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors
cites work: On the State Complexity of Combined Operations
cites work: Q4198075
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q3707407
cites work: Nondeterministic Space is Closed under Complementation
cites work: Q3815544
cites work: Minimal NFA Problems are Hard
cites work: Q5678435
cites work: Q3102144
cites work: Q5583856
DOI: 10.1016/J.TCS.2015.07.032
description: scientific article; zbMATH DE number 6519456