Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
On abstract families of languages, power series, and elements

On abstract families of languages, power series, and elements

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1337/1997
BookFoundations of Computer Science
DOI10.1007/BFb0052071
Copyright1997
ISBN978-3-540-63746-2
DOI10.1007/BFb0052080
Pages117-124
Subject CollectionComputer Science
SpringerLink DateThursday, June 08, 2006
Add to marked items

On abstract families of languages, power series, and elements

Georg Karner1 and Werner Kuich2

(1)  Alcatel Austria AG, Wien, Austria
(2)  Abteilung für Theoretische Informatik Institut für Algebra und Diskrete Mathematik Technische, Universität Wien, Austria
Abstract
We generalize the characterization of abstract families of languages by abstract families of acceptors to continuous semirings: Abstract families of elements are now characterized by automata representing a certain type.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.108 • Server: mpweb24
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)