Towards regular languages over infinite alphabets

DOI10.1007/3-540-44683-4_49MaRDI QIDQ4779173zbMATH OpenFDO

Authors Frank Neven, Thomas Schwentick, Victor Vianu

Publication date 25 November 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2136/21360560

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Finite state machines for strings over infinite alphabets
• On Notions of Regularity for Data Languages
• On notions of regularity for data languages
• Regular expressions for languages over infinite alphabets
• Computing and Combinatorics

Cited in

(39)

• Classes of regular and context-free languages over countably infinite alphabets
• Context-free languages over infinite alphabets
• An algebraic approach to data languages and timed languages
• An algebraic characterization of deterministic regular languages over infinite alphabets.
• Morphisms on infinite alphabets, countable states automata and regular sequences
• Layered memory automata: recognizers for quasi-regular languages with unbounded memory
• An automata-theoretic approach to model-checking systems and specifications over infinite data domains
• A note on the emptiness problem for alternating finite-memory automata
• Transducer-based analysis of cryptographic protocols
• Survey on formal models to reason about infinite data values
• Nominal automata for resource usage control
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• Graph reachability and pebble automata over infinite alphabets
• Variable tree automata over infinite ranked alphabets
• Regular and Context-Free Pattern Languages over Small Alphabets
• On synthesis of specifications with arithmetic
• On temporal logics with data variable quantifications: decidability and complexity
• The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
• P Finite Automata and Regular Languages over Countably Infinite Alphabets
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Counting Multiplicity over Infinite Alphabets
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• Computing and Combinatorics
• Automata over infinite alphabets
• A little bit infinite? On adding data to finitely labelled structures
• scientific article; zbMATH DE number 7136664 (Why is no real title available?)
• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• Deadlock detection in linear recursive programs
• Finite state machines for strings over infinite alphabets
• Regular and context-free nominal traces
• Tree Automata over Infinite Alphabets
• Regular expressions for languages over infinite alphabets
• Register-bounded synthesis
• Foundations of Software Science and Computation Structures
• Learning deterministic variable automata over infinite alphabets
• Variable automata over infinite alphabets
• Bounded languages over infinite alphabets
• The decision problem for some logics for finite words on infinite alphabets
• On notions of regularity for data languages

This page was built for publication: Towards regular languages over infinite alphabets

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