Generalized finite automata over real and complex numbers

DOI10.1016/j.tcs.2015.05.001zbMath1323.68274OpenAlexW2174668150MaRDI QIDQ2354406

Ameen Naif, Klaus Meer

Publication date: 13 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.001

zbMATH Keywords

generalized finite automatadecision problems for automata over uncountable structuresreal and complex number computations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computation over the reals, computable analysis (03D78)

Related Items

A computation model with automatic functions and relations as primitive operations, Periodic generalized automata over the reals, Decision Problems for Finite Automata over Infinite Algebraic Structures, A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real computational universality: the word problem for a class of groups with infinite presentation
• On the complexity of quadratic programming in real number models of computation
• Generalized Knapsack problems and fixed degree separations
• Membrane computing. An introduction.
• An explicit solution to Post's problem over the reals
• Finite Automata over Structures
• Lower bounds for solving linear diophantine equations on random access machines
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines