Timeline for Understanding Syntactic Congruence & Order
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 4 at 17:20 | comment | added | J.-E. Pin | Thanks Ben for your answer ! | |
| Apr 20 at 1:57 | vote | accept | Jason Berry | ||
| Apr 19 at 16:01 | comment | added | Jason Berry | Ok, I think I understand now. | |
| Apr 19 at 15:02 | comment | added | Benjamin Steinberg | I’m not sure I understand your comment. | |
| Apr 19 at 13:54 | comment | added | Jason Berry | Thank you for your response. Sorry if this is obvious, but to clarify with some examples (for preliminary understanding I work better with examples and cannot find many online). I think of congruence I think of mod (I.e. $16 \equiv 9 \equiv 2 ( mod7)$, always results in 2). But, with finite automata, the results that are the same are states and not the sequence of chars. For example, the following equivalence relations match on state but not char sequence, this is the syntactic congruence? Example: (3,ab,3), (3,aab,3), (3,aaab,3), ..., (3,aabb,3), (3,aaabbb,3), ... | |
| Apr 19 at 3:19 | history | edited | Benjamin Steinberg | CC BY-SA 4.0 |
added 284 characters in body
|
| Apr 19 at 3:14 | history | edited | Benjamin Steinberg | CC BY-SA 4.0 |
added 284 characters in body
|
| Apr 19 at 3:08 | history | answered | Benjamin Steinberg | CC BY-SA 4.0 |