Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
21
views
16
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,351
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theoretical Computer Science
A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
other
Author(s):
Alexander Kurz
,
Tomoyuki Suzuki
,
Emilio Tuosto
Publication date
(Print):
2012
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
African Languages
Most cited references
16
Record
: found
Abstract
: not found
Article
: not found
Finite-memory automata
Michael Kaminski
,
Nissim Francez
(1994)
0
comments
Cited
76
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Finite state machines for strings over infinite alphabets
Victor Vianu
,
Frank Neven
,
Thomas Schwentick
(2004)
0
comments
Cited
49
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Adding nesting structure to words
Rajeev Alur
,
P. Madhusudan
(2009)
0
comments
Cited
45
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 193-208
DOI:
10.1007/978-3-642-33475-7_14
SO-VID:
e2312c17-e753-48ed-ac1b-ea347adba3aa
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. E1
Erratum: Probabilistic Inference and Monadic Second Order Logic
pp. E2
Erratum: Cinderella versus the Wicked Stepmother
pp. 1
Computability and Non-computability Issues in Amorphous Computing
pp. 10
Static Single Information Form for Abstract Compilation
pp. 28
Input-Driven Stack Automata
pp. 43
Probabilistic Inference and Monadic Second Order Logic
pp. 57
Cinderella versus the Wicked Stepmother
pp. 72
Worst- and Average-Case Privacy Breaches in Randomization Mechanisms
pp. 87
Weak Bisimulations for Coalgebras over Ordered Functors
pp. 104
A Context-Free Linear Ordering with an Undecidable First-Order Theory
pp. 119
Open Bisimulation for Quantum Processes
pp. 134
A Modular LTS for Open Reactive Systems
pp. 149
Unidirectional Channel Systems Can Be Tested
pp. 164
On Properties and State Complexity of Deterministic State-Partition Automata
pp. 179
On Union-Free and Deterministic Union-Free Languages
pp. 193
A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
pp. 209
Formal Verification of Distributed Algorithms
pp. 225
A Temporal Logic for Multi-threaded Programs
pp. 240
The Algorithmic Complexity of k-Domatic Partition of Graphs
pp. 250
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
pp. 265
Modal Interface Automata
pp. 280
Proofs as Executions
pp. 295
Efficient Algorithms for the max k -vertex cover Problem
pp. 310
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words
pp. 325
Compositional Abstraction Techniques for Probabilistic Automata
pp. 342
Broadcast Abstraction in a Stochastic Calculus for Mobile Networks
pp. 357
An Intersection Type System for Deterministic Pushdown Automata
pp. 372
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
Similar content
5,351
Un modelo matemático de la política monetaria y la tasa de interés nominal nula en una economía nuevo keynesiana de expectativas estáticas
Authors:
Eddy Lizarazu Alanez
El sufijo de derivación nominal *-ii̯o- / *-i̯o- en los gerundios y gerundivos del R̥g-Veda y el Avesta.
Authors:
Francisco-Javier Rubio-Orecilla
A coefficient of agreement for nominal scales
Authors:
C. J.
See all similar