Succinct representation of regular sets using gotos and Boolean variables
From MaRDI portal
Publication:1101207
DOI10.1016/0022-0000(87)90008-0zbMath0642.68025MaRDI QIDQ1101207
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
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item