JFLAP (Java Formal Languages and Automata Package) is interactive educational software written in Java for experimenting with topics in the computer science area of formal languages and automata theory, primarily intended for use at the undergraduate level or as an advancedtopic for high school. JFLAP allows one to create and simulate structures, such as programming a finite state machine, and experiment with proofs, such as converting a nondeterministic finite automaton (NFA) to a deterministic finite automaton (DFA).
| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:label
| - JFLAP (en)
- JFLAP (it)
- JFLAP (ru)
- JFLAP (uk)
|
| rdfs:comment
| - JFLAP (англ. Java Formal Languages and Automata Package) — свободная кроссплатформенная программа для экспериментов с различными объектами, встречающихся в теории формальных языков. Разрабатывается Университетом Дьюка. (ru)
- JFLAP — програма для експериментів з різними об'єктами що зустрічаються під час вивчення формальних мов. Кросплатформенна (java). Розробляється Університетом Дюка під Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License. (uk)
- JFLAP (Java Formal Languages and Automata Package) is interactive educational software written in Java for experimenting with topics in the computer science area of formal languages and automata theory, primarily intended for use at the undergraduate level or as an advancedtopic for high school. JFLAP allows one to create and simulate structures, such as programming a finite state machine, and experiment with proofs, such as converting a nondeterministic finite automaton (NFA) to a deterministic finite automaton (DFA). (en)
- JFLAP è un software freeware per lo studio dell'informatica teorica, in particolare gli automi a stati finiti e i linguaggi formali. Il codice sorgente, scritto in Java, è disponibile sotto certe condizioni. Originariamente sviluppato da Susan H. Rodger negli anni 1990 in C/C++ per X Window con il nome di FLAP (Formal Languages and Automata Package), tale strumento includeva alcune funzionalità di JFLAP relative allo studio delle macchine a stati finiti, degli automi a pila e delle macchine di Turing. (it)
|
| foaf:name
| |
| name
| |
| foaf:depiction
| |
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| Link from a Wikipage to an external page
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| thumbnail
| |
| caption
| - JFLAP NFA to DFA proof (en)
|
| developer
| |
| genre
| |
| language
| |
| latest release date
| |
| latest release version
| |
| platform
| |
| screenshot
| |
| has abstract
| - JFLAP (Java Formal Languages and Automata Package) is interactive educational software written in Java for experimenting with topics in the computer science area of formal languages and automata theory, primarily intended for use at the undergraduate level or as an advancedtopic for high school. JFLAP allows one to create and simulate structures, such as programming a finite state machine, and experiment with proofs, such as converting a nondeterministic finite automaton (NFA) to a deterministic finite automaton (DFA). JFLAP is developed and maintained at Duke University, with support from the National Science Foundation since 1993. It is freeware and the source code of the most recent version is available, but under some restrictions. JFLAP runs as a Java application. (en)
- JFLAP è un software freeware per lo studio dell'informatica teorica, in particolare gli automi a stati finiti e i linguaggi formali. Il codice sorgente, scritto in Java, è disponibile sotto certe condizioni. Originariamente sviluppato da Susan H. Rodger negli anni 1990 in C/C++ per X Window con il nome di FLAP (Formal Languages and Automata Package), tale strumento includeva alcune funzionalità di JFLAP relative allo studio delle macchine a stati finiti, degli automi a pila e delle macchine di Turing. Dal 1994 gli studenti della Duke University hanno provveduto ad ampliare e convertire il software in Java. JFLAP permette la conversione da automa a stati finiti non deterministico in automa a stati finiti deterministico, in grammatica formale o in espressione regolare, la creazione di automi a pila a partire da grammatiche context-free e lo studio dei parser LR e SLR. (it)
- JFLAP (англ. Java Formal Languages and Automata Package) — свободная кроссплатформенная программа для экспериментов с различными объектами, встречающихся в теории формальных языков. Разрабатывается Университетом Дьюка. (ru)
- JFLAP — програма для експериментів з різними об'єктами що зустрічаються під час вивчення формальних мов. Кросплатформенна (java). Розробляється Університетом Дюка під Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License. (uk)
|
| gold:hypernym
| |
| prov:wasDerivedFrom
| |
| page length (characters) of wiki page
| |
| latest release version
| |
| computing platform
| |
| developer
| |
| genre
| |
| language
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)
