PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Goldstine, Jonathan"

Author of the publication

copydeleteadd this publication to your clipboard
A Prime Decomposition Theorem for Grammatical Families.

, , and . J. Comput. Syst. Sci., 24 (3): 315-361 (1982)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jonathan Böhm University of Stuttgart

Jonathan Eck University of Stuttgart

Jonathan Villing University of Stuttgart

Jonathan Stober University of Stuttgart

Jonathan Skalden University of Stuttgart

 

Other publications of authors with the same name

Some Independent Families of One-Letter Languages.. J. Comput. Syst. Sci., 10 (3): 351-369 (1975)Uniformly Erasable AFL, , and . STOC, page 207-213. ACM, (1972)On the Relation between Ambiguity and Nondeterminism in Finite Automata, , and . Inf. Comput., 100 (2): 261-270 (October 1992)Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems., , and . Journal of Automata, Languages and Combinatorics, 7 (1): 127-142 (2002)Measuring Nondeterminism in Pushdown Automata., , and . STACS, volume 1200 of Lecture Notes in Computer Science, page 295-306. Springer, (1997)Intersection-Closed Full AFL and the Recursively Enumerable Languages, and . Information and Control, 22 (3): 201-231 (April 1973)On the Largest Full SubAFL of an AFL., and . Mathematical Systems Theory, 6 (3): 241-242 (1972)Continuous Operations on Languages.. Mathematical Systems Theory, (1977)Book Reviews., , and . SIGACT News, 26 (2): 26-32 (1995)On Measuring Nondeterminism in Regular Languages, , and . Inf. Comput., 86 (2): 179-194 (June 1990)