Succinct representation of regular sets using gotos and Boolean variables (Q1101207): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(87)90008-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2003000704
@@ Property / OpenAlex ID: W2003000704 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+On equations for regular languages, finite automata, and sequential networks
+Normal rank
@@ Property / cites work @@
+Complexity measures for regular expressions
@@ Property / cites work: Complexity measures for regular expressions / rank @@
+Normal rank
@@ Property / cites work @@
+Propositional dynamic logic of regular programs
@@ Property / cites work: Propositional dynamic logic of regular programs / rank @@
+Normal rank
@@ Property / cites work @@
+Mappings of languages by two-tape devices
@@ Property / cites work: Mappings of languages by two-tape devices / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of program structures: Schemes, semantics, verification
+Normal rank
@@ Property / cites work @@
+The propositional dynamic logic of deterministic, well-structured programs
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Programming Techniques: Regular expression search algorithm
+Normal rank
@@ Property / cites work @@
+Q3326832
@@ Property / cites work: Q3326832 / rank @@
+Normal rank