Sciweavers

644 search results - page 15 / 129
» Precedence Automata and Languages
Sort
View
CONCUR
2010
Springer
15 years 14 days ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
FOSSACS
2008
Springer
15 years 27 days ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
SIGCSE
1999
ACM
145views Education» more  SIGCSE 1999»
15 years 3 months ago
Using JFLAP to interact with theorems in automata theory
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
Eric Gramond, Susan H. Rodger