Regular languages viewed from a graph-theoretic perspective
type: Item
instance of: scholarly article
title: Regular languages viewed from a graph-theoretic perspective
zbMATH Open document ID: 1362.68146
author: Marius Konitzer
author: Hans Ulrich Simon
published in: Information and Computation
publication date: 2017-03-16T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6695656
zbMATH Keywords: regular language
zbMATH Keywords: lookahead DFA
zbMATH Keywords: clique number
zbMATH Keywords: maximum degree
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ic.2016.06.012
OpenAlex ID: W2410277739
cites work: Practical arbitrary lookahead LR parsing
cites work: Q5725992
cites work: A survey of bounds for classical Ramsey numbers
cites work: Q2764078
cites work: Schur numbers and the Ramsey numbers N(3,3,\dots ,3;2)
cites work: Q3122694
cites work: On the translation of languages from left to right
cites work: Q5404861
cites work: DFA with a Bounded Activity Level
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: LR-regular grammars - an extension of LR(k) grammars
cites work: Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
DOI: 10.1016/J.IC.2016.06.012
description: scientific article; zbMATH DE number 6695656