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
34
views
25
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,957
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Nominal Automata with Name Binding
other
Author(s):
Lutz Schröder
,
Dexter Kozen
,
Stefan Milius
,
Thorsten Wißmann
Publication date
(Online):
March 16 2017
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
ScienceOpen Research
Most cited references
25
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
Book Chapter
: not found
Automata and Logics for Words and Trees over an Infinite Alphabet
Luc Segoufin
(2006)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
March 16 2017
Pages
: 124-142
DOI:
10.1007/978-3-662-54458-7_8
SO-VID:
e50f4fbf-68f2-4712-b8f9-7e5c82365472
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Coherence Spaces and Uniform Continuity
pp. 20
The Free Exponential Modality of Probabilistic Coherence Spaces
pp. 36
From Qualitative to Quantitative Semantics
pp. 53
Almost Every Simply Typed $$\lambda $$ -Term Has a Long $$\beta $$ -Reduction Sequence
pp. 71
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
pp. 88
Equational Theories of Abnormal Termination Based on Kleene Algebra
pp. 106
Companions, Codensity and Causality
pp. 124
Nominal Automata with Name Binding
pp. 145
On the Existence of Weak Subgame Perfect Equilibria
pp. 162
Optimal Reachability in Divergent Weighted Timed Games
pp. 179
Bounding Average-Energy Games
pp. 196
Logics of Repeating Values on Data Trees and Branching Counter Systems
pp. 215
Degree of Sequentiality of Weighted Automata
pp. 231
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
pp. 248
Partial Derivatives for Context-Free Languages
pp. 265
Dynamic Complexity of the Dyck Reachability
pp. 283
Cyclic Arithmetic Is Equivalent to Peano Arithmetic
pp. 301
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
pp. 321
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
pp. 338
Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables
pp. 355
Pointless Learning
pp. 370
On Higher-Order Probabilistic Subrecursion
pp. 389
A Truly Concurrent Game Model of the Asynchronous $$\pi $$ -Calculus
pp. 407
Local Model Checking in a Logic for True Concurrency
pp. 424
The Paths to Choreography Extraction
pp. 441
On the Undecidability of Asynchronous Session Subtyping
pp. 461
A Lambda-Free Higher-Order Recursive Path Order
pp. 480
Automated Constructivization of Proofs
pp. 499
A Light Modality for Recursion
pp. 517
Unifying Guarded and Unguarded Iteration
pp. 534
Partiality, Revisited
pp. 550
On the Semantics of Intensionality
Similar content
3,957
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
Cited by
3
CoPaR: An Efficient Generic Partition Refiner
Authors:
Hans-Peter Deifel
,
Stefan Milius
,
Lutz Werner Schröder
…
Path Category for Free
Authors:
Thorsten Wißmann
,
Jérémy Dubut
,
Shin-ya Katsumata
…
Graded Monads for the Linear Time - Branching Time Spectrum
Authors:
Ulrich Dorsch
,
Stefan Milius
,
Lutz Werner Schröder
See all cited by