Succinct representation of regular sets using gotos and Boolean variables

DOI10.1016/0022-0000(87)90008-0zbMath0642.68025OpenAlexW2003000704MaRDI QIDQ1101207

Karl R. Abrahamson

Publication date: 1987

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90008-0

zbMATH Keywords

regular expressionspropositional dynamic logicBoolean variablesgotosregular sets of strings

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On equations for regular languages, finite automata, and sequential networks
• The propositional dynamic logic of deterministic, well-structured programs
• Complexity measures for regular expressions
• Theory of program structures: Schemes, semantics, verification
• Propositional dynamic logic of regular programs
• Mappings of languages by two-tape devices
• Programming Techniques: Regular expression search algorithm