Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Inferring Regular Trace Languages from Positive and Negative Samples

From MaRDI portal
Publication:3588361
Jump to:navigation, search

DOI10.1007/978-3-642-15488-1_3zbMath1291.68228OpenAlexW1748483954MaRDI QIDQ3588361

Antonio Cano Gómez

Publication date: 10 September 2010

Published in: Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15488-1_3



Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)


Related Items (1)

Commutative regular languages with product-form minimal automata







This page was built for publication: Inferring Regular Trace Languages from Positive and Negative Samples

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3588361&oldid=16999637"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 03:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki