Cargando…
Well-quasi orders in computation, logic, language and reasoning: a unifying concept of proof theory, automata theory, formal languages and descriptive set theory
This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra...
Autores principales: | Schuster, Peter, Seisenberger, Monika, Weiermann, Andreas |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2020
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-030-30229-0 http://cds.cern.ch/record/2706765 |
Ejemplares similares
-
Theory of automata, formal languages and computation
por: Xavier, SPE
Publicado: (2004) -
Fuzzy Automata and Languages: Theory and Applications
por: Mordeson, John N
Publicado: (2002) -
Formal languages and automata theory
por: Sunitha, K V N, et al.
Publicado: (2015) -
A course in formal languages, automata and groups
por: Chiswell, Ian M
Publicado: (2009) -
Introduction to automata theory, formal languages and computation
por: Kandar, Shyamalendu
Publicado: (2013)