Automata over infinite alphabets

DOI10.1142/9789814271059_0017MaRDI QIDQ4907869zbMATH OpenOpenAlexFDO

Authors

Publication date 26 February 2013

Published in Modern Applications of Automata Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/882ba64add9c83114960219da602ac0c9bd154ba

zbMATH Keywords

automatainfinite alphabetsverification

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Finite state machines for strings over infinite alphabets
• scientific article; zbMATH DE number 1834677
• Finite-state automata on infinite inputs
• Finite-memory automata
• Automata theory and model checking

Cited in

(21)

• Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
• Context-free languages over infinite alphabets
• Morphisms on infinite alphabets, countable states automata and regular sequences
• Survey on formal models to reason about infinite data values
• Decision Problems for Finite Automata over Infinite Algebraic Structures
• Automata based verification over linearly ordered data domains
• scientific article; zbMATH DE number 3862472 (Why is no real title available?)
• scientific article; zbMATH DE number 3868625 (Why is no real title available?)
• Finite automata over infinite alphabets: two models with transitions for local change
• Variable automata over infinite alphabets
• Tightening the Exchange Rates Between Automata
• Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
• Counting Multiplicity over Infinite Alphabets
• scientific article; zbMATH DE number 3983141 (Why is no real title available?)
• Finite automata over infinite alphabets: two models with transitions for local change
• Finite-state automata on infinite inputs
• scientific article; zbMATH DE number 7204453 (Why is no real title available?)
• Finite state machines for strings over infinite alphabets
• On Finite Alphabets and Infinite Bases III: Simulation
• Set augmented finite automata over infinite alphabets
• Jumping automata over Infinite words

This page was built for publication: Automata over infinite alphabets

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