Regular Closure of Deterministic Languages

DOI10.1137/S009753979528682XzbMath0937.68073MaRDI QIDQ4268872

Mark-Jan Nederhof, E. Bertsch

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

context-free languagesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (12)

A linear-time simulation of deterministic \(d\)-limited automata ⋮ Fast parallel recognition of LR language suffixes ⋮ Regulated nondeterminism in pushdown automata ⋮ Finite turns and the regular closure of linear context-free languages ⋮ Context-dependent nondeterminism for pushdown automata ⋮ Regulated Nondeterminism in Pushdown Automata ⋮ Kernels of Sub-classes of Context-Free Languages ⋮ Detecting Useless Transitions in Pushdown Automata ⋮ On Extended Regular Expressions ⋮ Detecting useless transitions in pushdown automata ⋮ A pumping lemma for regular closure of prefix-free languages ⋮ Boolean kernels of context-free languages

This page was built for publication: Regular Closure of Deterministic Languages