Counting Multiplicity over Infinite Alphabets

DOI10.1007/978-3-642-04420-5_14zbMath1260.68209OpenAlexW1619826587MaRDI QIDQ3646259

No author found.

Publication date: 19 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04420-5_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Weak and Nested Class Memory Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of regular and context-free languages over countably infinite alphabets
• Langages sur des alphabets infinis
• Finite-memory automata
• A logical characterization of data languages.
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Adding Nesting Structure to Words
• Automata on Gauss Words
• On the Computational Power of Querying the History
• Finite state machines for strings over infinite alphabets
• On Notions of Regularity for Data Languages

This page was built for publication: Counting Multiplicity over Infinite Alphabets