Succinct representation of regular sets using gotos and Boolean variables
type: Item
instance of: scholarly article
title: Succinct representation of regular sets using gotos and Boolean variables
zbMATH Open document ID: 0642.68025
DOI: 10.1016/0022-0000(87)90008-0
author: Karl R. Abrahamson
published in: Journal of Computer and System Sciences
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 4047055
zbMATH Keywords: propositional dynamic logic
zbMATH Keywords: regular sets of strings
zbMATH Keywords: gotos
zbMATH Keywords: Boolean variables
zbMATH Keywords: regular expressions
MaRDI profile type: Publication
full work available at URL: 0022-0000(87)90008-0
OpenAlex ID: W2003000704
cites work: Q4773298
cites work: On equations for regular languages, finite automata, and sequential networks
cites work: Complexity measures for regular expressions
cites work: Propositional dynamic logic of regular programs
cites work: Mappings of languages by two-tape devices
cites work: Theory of program structures: Schemes, semantics, verification
cites work: The propositional dynamic logic of deterministic, well-structured programs
cites work: Q4131648
cites work: Programming Techniques: Regular expression search algorithm
cites work: Q3326832
description: scientific article; zbMATH DE number 4047055