Decision Problems for Finite Automata over Infinite Algebraic Structures

DOI10.1007/978-3-319-40946-7_1zbMath1475.68158OpenAlexW2502542584MaRDI QIDQ2830202

Bakhadyr Khoussainov, Jiamou Liu

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

A computation model with automatic functions and relations as primitive operations ⋮ Periodic generalized automata over the reals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Finite-memory automata
• Deterministic automata. Simulation, universality and minimality
• Finite nondeterministic automata: simulation and minimality
• Generalized finite automata over real and complex numbers
• Periodic Generalized Automata over the Reals
• Finite Automata over Structures
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Algorithmic Analysis of Array-Accessing Programs
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Finite state machines for strings over infinite alphabets
• Automated Technology for Verification and Analysis
• Flat Parametric Counter Automata

This page was built for publication: Decision Problems for Finite Automata over Infinite Algebraic Structures