Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change

DOI10.1007/978-3-319-21500-6_16zbMath1386.68088OpenAlexW1147533053MaRDI QIDQ3451103

Christopher Czyba, Christopher Spinrath, Wolfgang Thomas

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21500-6_16

Mathematics Subject Classification ID

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

Related Items (4)

Solving Infinite Games in the Baire Space ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$

Cites Work

• A note on decision problems for three-way two-dimensional finite automata
• Finite-memory automata
• Abstraction and pattern classification
• Two-variable logic on data words
• Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
• An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change