Chomskian hierarchies of families of sets of piecewise continuous functions

DOI10.1007/S00224-004-1176-0zbMATH Open1088.68091OpenAlexW1967620500MaRDI QIDQ705136FDOQ705136

Authors: Keijo Ruohonen 

Publication date: 25 January 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1176-0

Recommendations

• Finite automata with multiset memory: a new characterization of Chomsky hierarchy
• Recursion theory on the reals and continuous-time computation
• An automata-theoretic characterization of the Chomsky-hierarchy
• Machines, Computations, and Universality
• Finite Automata Computing Real Functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (1)

• A Survey on Analog Models of Computation

This page was built for publication: Chomskian hierarchies of families of sets of piecewise continuous functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705136)