Conference item

What You Must Remember When Processing Data Words

Abstract:: We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characterization result, we obtain a canonical representation for any DMA-recognizable language. We then show that this canonical automaton is minimal in a strong sense: it has the minimal number of control states and also the minimal amount of internal storage. We finally show how this minimal automaton can be computed.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Benedikt, M., Ley, C., & Puppis, G. (2010). What You Must Remember When Processing Data Words. Alberto Mendelzon Workshop on Foundations of Databases.

MLA Style

Benedikt, M., et al. “What You Must Remember When Processing Data Words.” Alberto Mendelzon Workshop on Foundations of Databases, 2010.

Chicago Style

Benedikt, M, C Ley, and G Puppis. 2010. “What You Must Remember When Processing Data Words.” In Alberto Mendelzon Workshop on Foundations of Databases.
Share
Print

Authors

+ Benedikt, M More by this author

Role:: Author

+ Ley, C More by this author

Role:: Author

+ Puppis, G More by this author

Role:: Author

Host title:: Alberto Mendelzon Workshop on Foundations of Databases
Publication date:: 2010-01-01

UUID:: uuid:8d16f636-a4c3-4e3f-81ba-034bfc197159
Local pid:: cs:3617
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2010

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP