Formal Languages, Formally and Coinductively
Traditionally, formal languages are defined as sets of words. More recently, the alternative coalgebraic or coinductive representation as infinite tries, i.e., prefix trees branching over the alphabet, has been used to obtain compact and elegant proofs of classic results in language theory. In this...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Logical Methods in Computer Science e.V.
2017-09-01
|
| श्रृंखला: | Logical Methods in Computer Science |
| विषय: | |
| ऑनलाइन पहुंच: | https://lmcs.episciences.org/2564/pdf |