Q5166599
type: Item
instance of: scholarly article
zbMATH Open document ID: 1292.68001
author: Olivier Carton
publication date: 2014-06-27T00:00:00Z
full work available at URL: http://www.calameo.com/read/00001585686ff5c1a1e02
Mathematics Subject Classification ID: 68-01
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 6309316
zbMATH Keywords: formal languages
zbMATH Keywords: rational languages
zbMATH Keywords: algebraic languages
zbMATH Keywords: grammars
zbMATH Keywords: automata
zbMATH Keywords: Turing machines
zbMATH Keywords: recursively enumerable languages
zbMATH Keywords: recursion theorem
zbMATH Keywords: decidability
zbMATH Keywords: recursive functions
zbMATH Keywords: time complexity
zbMATH Keywords: space complexity
zbMATH Keywords: complexity classes
zbMATH Keywords: NP-completeness
zbMATH Keywords: hierarchy theorem
zbMATH Keywords: alternating machines
MaRDI profile type: MaRDI publication profile
Recommended article: Q4874659
Recommended article: Q5367067
Recommended article: Formal Languages, Formally and Coinductively
Recommended article: Q4668908
Recommended article: Q5401642
Recommended article: Q3814812
Recommended article: Formal languages and applications.
Recommended article: Languages, Decidability, and Complexity
Recommended article: Modern aspects of complexity within formal languages
Recommended article: Extension complexity of formal languages
description: scientific article; zbMATH DE number 6309316