On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata (Q3698326)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata |
scientific article; zbMATH DE number 3924159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata |
scientific article; zbMATH DE number 3924159 |
Statements
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata (English)
0 references
1985
0 references
finite automata
0 references
finite state transducers
0 references
ambiguous automata
0 references
equivalence problem
0 references
containment problem
0 references
nondeterministic finite automaton
0 references
accepting state transition sequence
0 references
degree of ambiguity
0 references
homogeneous linear difference equations
0 references
regular expressions
0 references
regular grammars
0 references
0.8585400581359863
0 references
0.8518224954605103
0 references
0.8416223526000977
0 references
0.8407935500144958
0 references
