Chrobak Normal Form Revisited, with Applications
type: Item
instance of: scholarly article
title: Chrobak Normal Form Revisited, with Applications
zbMATH Open document ID: 1297.68130
DOI: 10.1007/978-3-642-22256-6_14
author: Paweł Gawrychowski
published in: Implementation and Application of Automata
publication date: 2011-07-29T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5934387
zbMATH Keywords: unary automata
zbMATH Keywords: descriptional complexity
Wikidata QID: Q63071609
MaRDI profile type: Publication
full work available at URL: 978-3-642-22256-6 14
OpenAlex ID: W126002049
cites work: Finite automata and unary languages
cites work: Simulating finite automata with context-free grammars.
cites work: Q4133124
cites work: On a linear diophantine problem of Frobenius
cites work: Magic numbers in the state hierarchy of finite automata
cites work: Finite Automata, Digraph Connectivity, and Regular Expression Size
cites work: On Context-Free Languages
cites work: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
cites work: Unary finite automata vs. arithmetic progressions
description: scientific article; zbMATH DE number 5934387