Journal ArticleDOI
Simulating finite automata with context-free grammars
Reads0
Chats0
TLDR
This work considers simulating finite automata (both deterministic and nondeterministic) with context-free grammars in Chomsky normal form (CNF), and shows that any unary DFA with n states can be simulated by a CNF grammar with O(n1/3) variables.About:
This article is published in Information Processing Letters.The article was published on 2002-12-31. It has received 13 citations till now. The article focuses on the topics: Context-sensitive grammar & Context-free grammar.read more
Citations
More filters
Journal ArticleDOI
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Artur Jeż,Alexander Okhotin +1 more
TL;DR: The results imply undecidability of a number of decision problems of unary conjunctive grammars, as well as non-existence of a recursive function bounding the growth rate of the generated languages.
Journal ArticleDOI
Finite state complexity
TL;DR: A version of Algorithmic Information Theory based on finite transducers instead of Turing machines is developed, called finite-state complexity, which is computable and there is no a priori upper bound for the number of states used for minimal descriptions of arbitrary strings.
Book ChapterDOI
Chrobak normal form revisited, with applications
TL;DR: A very simple conversion procedure working in O(n3) time is presented and the algorithm is extended to improve two trade-offs concerning conversions between different representations of unary regular languages.
Journal ArticleDOI
Deterministic pushdown automata and unary languages
TL;DR: It is shown that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a number of states that is exponential in s, and it is proved that there are unary languages for which deterministic Pushdown automata cannot be exponentially more succinct than finite automata.
Book ChapterDOI
Descriptional Complexity of Input-Driven Pushdown Automata
TL;DR: The size blow-up of determinization is considered in more detail, and a lower bound construction is given, that is tight within a multiplicative constant, with respect to the size of the nondeterministic automaton both for the number of states and thenumber of stack symbols.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
The state complexities of some basic operations on regular languages
TL;DR: It is shown that the number of states that is sufficient and necessary in the worst case for a deterministic finite automaton (DFA) to accept the catenation of an m-state DFA language and an n-stateDFA language is exactly m2n − 2n − 1, for m, n ⩾ 1.
Journal ArticleDOI
Finite automata and unary languages
TL;DR: It is proved that O(e √ n log n ) states are sufficient to simulate an n -state 1nfa recognizing a unary language by a 1dfa and the lower bound is the same.