Výsledky vyhledávání - Theory of computation Formal languages and automata theory :: NVK CVTI SR

1

Formal Methods

Přispěvatelé: Platzer, Andre Rozier, Kristin Yvonne Pradella, Matteo a další

Témata: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, Software Engineering, Mathematical theory of computation, Expert systems / knowledge-based systems, Programming and scripting languages: general, Computer hardware, Natural language and machine translation

Popis souboru: application/pdf

Relation: Lecture Notes in Computer Science

Přístupová URL adresa: https://library.oapen.org/handle/20.500.12657/93255

Full Text Finder Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
2

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

Autoři: Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina a další

Přispěvatelé: Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina a další

Zdroj: Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
Guha, S, Jecker, I, Lehtinen, K & Zimmermann, M 2024, 'A bit of nondeterminism makes pushdown automata expressive and succinct', Logical Methods in Computer Science, vol. 20, no. 1, 39, pp. 3:1–3:39. https://doi.org/10.46298/lmcs-20(1:3)2024
46th International Symposium on Mathematical Foundations of Computer Science

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Logic, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Pushdown Automata, Succintness, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 12. Responsible consumption, computer science - logic in computer science, Synthesis, 0202 electrical engineering, electronic engineering, information engineering, 14. Life underwater, Formal Languages and Automata Theory, Computer Science, BC1-199, Logic in Computer Science, Theory of computation → Formal languages and automata theory, 4. Education, QA75.5-76.95, Good-for-games, Logic in Computer Science (cs.LO), computer science - formal languages and automata theory, Electronic computers. Computer science, Computer Science, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2105.02611
https://lmcs.episciences.org/10156
https://doi.org/10.46298/lmcs-20(1:3)2024
http://livrepository.liverpool.ac.uk/3130035/1/2105.02611v1.pdf
https://doaj.org/article/03ee626ded51408a95e4d810f7c4816d
http://www.scopus.com/inward/record.url?scp=85186488986&partnerID=8YFLogxK
https://vbn.aau.dk/ws/files/749985196/2105.02611.pdf
https://doi.org/10.46298/lmcs-20(1:3)2024
https://vbn.aau.dk/da/publications/a389c202-828c-4303-877b-5eebb7556241
https://drops.dagstuhl.de/opus/volltexte/2021/14493/
https://livrepository.liverpool.ac.uk/id/eprint/3130035
https://drops.dagstuhl.de/opus/volltexte/2021/14493/pdf/LIPIcs-MFCS-2021-53.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-02611
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.53

View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
3

FO logic on cellular automata orbits equals MSO logic

Autoři: Theyssier, Guillaume Guillaume Theyssier

Přispěvatelé: Theyssier, Guillaume Guillaume Theyssier

Témata: FO logic, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theory of computation → Models of computation, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Discrete Mathematics (cs.DM), Theory of computation → Formal languages and automata theory, cellular automata, [MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS], Cayley Graphs, MSO logic, Cellular Automata, Dynamical Systems (math.DS), Theory of computation → Logic, Cayley graphs, Logic in Computer Science (cs.LO), Domino Problem, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], domino problem, FOS: Mathematics, ddc:004, Mathematics - Dynamical Systems, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2404.16430
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.154
https://hal.science/hal-04558369v1
https://hal.science/hal-04558369v1/document
https://doi.org/10.4230/lipics.icalp.2024.154
https://hal.science/hal-04785124v1
https://doi.org/10.4230/lipics.icalp.2024.154

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
4

Type-Constrained Code Generation with Language Models

Autoři: Mündler, Niels He, Jingxuan Wang, Hao a další

Zdroj: Proceedings of the ACM on Programming Languages. 9(PLDI)

Témata: Information and Computing Sciences, Software Engineering, Code Generation, Language Model, Type System, Program Synthesis, Program Translation, Program Repair, Constrained Decoding, Software engineering, Theory of computation, Numerical and computational mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/8xw132rt
https://escholarship.org/content/qt8xw132rt/qt8xw132rt.pdf

View record at eScholarship

Přidat do oblíbených

Uloženo v:
5

Artificial grammar learning meets formal language theory: an overview

Autoři: Fitch, W. Tecumseh Friederici, Angela D.

Zdroj: Philosophical Transactions: Biological Sciences, 2012 Jul . 367(1598), 1933-1955.

Přístupová URL adresa: https://www.jstor.org/stable/23250425

Full Text Full Text Finder Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
6

Regular Methods for Operator Precedence Languages

Autoři: Henzinger, Thomas A. Kebis, Pavol Mazzocchi, Nicolas a další

Přispěvatelé: Henzinger, Thomas A. Kebis, Pavol Mazzocchi, Nicolas a další

Zdroj: Schloss Dagstuhl-Leibniz-Zentrum für Informatik

Témata: FOS: Computer and information sciences, antichain algorithm, Formal Languages and Automata Theory (cs.FL), Theory of computation → Formal languages and automata theory, operator precedence automata, Computer Science - Formal Languages and Automata Theory, ddc:004, syntactic congruence

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2305.03447
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.129

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
7

History-Deterministic Parikh Automata

Autoři: Erlich, Enzo Guha, Shibashis Jecker, Ismaël a další

Přispěvatelé: Erlich, Enzo Guha, Shibashis Jecker, Ismaël a další

Zdroj: Erlich, E, Guha, S, Jecker, I, Lehtinen, K & Zimmermann, M 2023, History-Deterministic Parikh Automata. in G A Perez & J-F Raskin (eds), 34th International Conference on Concurrency Theory, CONCUR 2023. vol. 279, 31, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, pp. 31:1-31:16, 34th International Conference on Concurrency Theory (CONCUR 2023), Antwerpen, Belgium, 18/09/2023. https://doi.org/10.4230/LIPICS.CONCUR.2023.31

Témata: Reversal-bounded Counter Machines, Theory of computation → Formal languages and automata theory, Parikh automata, [INFO] Computer Science [cs], ddc:004, History-determinism

Popis souboru: application/pdf; text/html; charset=utf-8

Přístupová URL adresa: http://www.scopus.com/inward/record.url?scp=85167928574&partnerID=8YFLogxK
https://vbn.aau.dk/ws/files/679672473/LIPIcs.CONCUR.2023.31.pdf
https://vbn.aau.dk/da/publications/adb27469-8f2b-45e2-9286-2c07658ba075
https://dblp.org/rec/conf/concur/ErlichGJL023
https://doi.org/10.4230/LIPICS.CONCUR.2023.31
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.31
https://hal.science/hal-04222543v1/document
https://hal.science/hal-04222543v1
https://doi.org/10.4230/lipics.concur.2023.31

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
8

Explorable Automata

Autoři: Hazard, Emile Kuperberg, Denis Emile Hazard and Denis Kuperberg a další

Přispěvatelé: Hazard, Emile Kuperberg, Denis Emile Hazard and Denis Kuperberg a další

Témata: automata, Theory of computation → Formal languages and automata theory, Nondeterminism, ddc:004, complexity, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.24
https://hal.science/hal-03669659v2/document
https://hal.science/hal-03669659v2
https://doi.org/10.4230/lipics.csl.2023.24

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
9

Enumerating Regular Languages with Bounded Delay

Autoři: Amarilli, Antoine Monet, Mikaël Data, Intelligence and Graphs (DIG) a další

Přispěvatelé: Amarilli, Antoine Monet, Mikaël Data, Intelligence and Graphs (DIG) a další

Zdroj: STACS ; https://hal.science/hal-03940590 ; STACS, Mar 2023, Hamburg, Germany. ⟨10.4230/LIPIcs.STACS.2023.8⟩

Témata: Regular language, Constant-delay enumeration, Edit distance, Theory of computation → Formal languages and automata theory, [INFO]Computer Science [cs]

Geografické téma: Hamburg, Germany

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2209.14878; ARXIV: 2209.14878

Dostupnost: https://hal.science/hal-03940590
https://hal.science/hal-03940590v1/document
https://hal.science/hal-03940590v1/file/enumerating.pdf
https://doi.org/10.4230/LIPIcs.STACS.2023.8

View record from BASE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
10

LIPIcs, Volume 289, STACS 2024, Complete Volume: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Autoři: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a další

Přispěvatelé: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a další

Témata: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs

Přístupová URL adresa: https://hal.science/hal-04859229v1

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
11

Enumerating Regular Languages with Bounded Delay

Autoři: Amarilli, Antoine Monet, Mikaël Antoine Amarilli and Mikaël Monet

Přispěvatelé: Amarilli, Antoine Monet, Mikaël Antoine Amarilli and Mikaël Monet

Témata: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Edit distance, Theory of computation → Formal languages and automata theory, constant-delay enumeration, Regular language, Computer Science - Formal Languages and Automata Theory, edit distance, 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences, Constant-delay enumeration, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2209.14878
https://hal.science/hal-03940590v1/document
https://hal.science/hal-03940590v1
https://doi.org/10.4230/lipics.stacs.2023.8
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.8

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
12

Agafonov's theorem for probabilistic selectors

Autoři: Léchine, Ulysse Seiller, Thomas Simonsen, Jakob Grue a další

Přispěvatelé: Léchine, Ulysse Seiller, Thomas Simonsen, Jakob Grue a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; Mathematical Foundations of Computer Science ; https://hal.science/hal-04563952 ; Mathematical Foundations of Computer Science, Aug 2024, Bratislava, Slovakia. pp.67:1-67:15, ⟨10.4230/LIPIcs.MFCS.2024.67⟩

Témata: Normal Sequences, Probabilistic Automata, Agafonov's Theorem, Agafonov’s theorem, Theory of computation → Formal languages and automata theory, Theory of computation → Probabilistic computation, Theory of computation → Randomness, geometry and discrete structures, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]

Geografické téma: Bratislava, Slovakia

Dostupnost: https://hal.science/hal-04563952
https://hal.science/hal-04563952v1/document
https://hal.science/hal-04563952v1/file/Probabilistic__Automata_for__Agafonov-6.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2024.67

View record from BASE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
13

Foundations of Software Science and Computation Structures

Přispěvatelé: Kiefer, Stefan Tasson, Christine

Témata: Mathematical Logic and Formal Languages, Theory of Computation, Natural Language Processing (NLP), Database Management, Programming Techniques, Formal Languages and Automata Theory, automata theory, databases, formal languages, formal logic, computational linguistics, open access, semantics, categorical models and logics, language theory, automata, and games, modal, spatial, and temporal logics, type theory and proof theory, concurrency theory and process calculi, rewriting theory, logical foundations of data bases, models of software security, logical aspects of computation complexity, logics of programming, Mathematical theory of computation, Computer science, Natural language & machine translation, Database programming, Computer programming / software engineering, Artificial intelligence, Databases

Popis souboru: application/pdf

Relation: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues

Přístupová URL adresa: https://library.oapen.org/handle/20.500.12657/48218

Full Text Finder Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
14

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous

Autoři: Guillou, Lucie Sangnier, Arnaud Sznajder, Nathalie a další

Přispěvatelé: Guillou, Lucie Sangnier, Arnaud Sznajder, Nathalie a další

Zdroj: 34th International Conference on Concurrency Theory, CONCUR 2023
https://hal.sorbonne-universite.fr/hal-04286027
34th International Conference on Concurrency Theory, CONCUR 2023, Sep 2023, Antwerp, Belgium. pp.7:1-7:17, ⟨10.4230/LIPICS.CONCUR.2023.7⟩

Témata: Parameterised verification, Coverability, Counter machines, Theory of computation → Formal languages and automata theory, [INFO]Computer Science [cs]

Geografické téma: Antwerp, Belgium

Dostupnost: https://hal.sorbonne-universite.fr/hal-04286027
https://hal.sorbonne-universite.fr/hal-04286027v1/document
https://hal.sorbonne-universite.fr/hal-04286027v1/file/GSS-CONCUR23.pdf
https://doi.org/10.4230/LIPICS.CONCUR.2023.7

View record from BASE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
15

Some Contributions to the Algebraic Theory of Automata

Autoři: Cosme i Llópez, Enric

Thesis Advisors: Ballester-Bolinches, Adolfo, Pin, Jean-Éric, Departament d'Algebra

Témata: semigroups, automata, formal languages, formations, congruences, monoid, duality

Přístupová URL adresa: http://hdl.handle.net/10550/47933

View record in TDX

Přidat do oblíbených

Uloženo v:
16

Some Contributions to the Algebraic Theory of Automata

Autoři: Cosme i Llópez, Enric

Thesis Advisors: Ballester-Bolinches, Adolfo, Pin, Jean-Éric, Departament d'Algebra

Témata: semigroups, automata, formal languages, formations, congruences, monoid, duality

Přístupová URL adresa: http://hdl.handle.net/10803/570147

View record in TDX

Přidat do oblíbených

Uloženo v:
17

Closure Properties of General Grammars -- Formally Verified

Autoři: Dvorak, Martin Blanchette, Jasmin Martin Dvorak and Jasmin Blanchette

Přispěvatelé: Dvorak, Martin Blanchette, Jasmin Martin Dvorak and Jasmin Blanchette

Témata: FOS: Computer and information sciences, 2012 ACM Subject Classification Theory of computation → Formal languages and automata theory phrases Lean type-0 grammars recursively enumerable languages Kleene star, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Formal languages and automata theory phrases Lean, recursively enumerable languages, 0202 electrical engineering, electronic engineering, information engineering, Lean, Kleene star, ddc:004, Theory of computation → Rewrite systems, type-0 grammars

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2302.06420
https://inria.hal.science/hal-04298533v1/document
https://doi.org/10.4230/lipics.itp.2023.15
https://inria.hal.science/hal-04298533v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.15

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
18

Some Contributions to the Algebraic Theory of Automata

Autoři: Cosme i Llópez, Enric

Thesis Advisors: Ballester-Bolinches, Adolfo, Pin, Jean-Éric, Departament d'Algebra

Témata: semigroups, automata, formal languages, formations, congruences, monoid, duality

Přístupová URL adresa: http://hdl.handle.net/10550/47933

View record in TDX

Přidat do oblíbených

Uloženo v:
19

single use automata and transducers for infinite alphabets

Autoři: Bojańczyk, Mikołaj Stefański, Rafał Mikołaj Bojańczyk and Rafał Stefański a další

Přispěvatelé: Bojańczyk, Mikołaj Stefański, Rafał Mikołaj Bojańczyk and Rafał Stefański a další

Zdroj: ICALP

Témata: Theory of computation → Formal languages and automata theory, data words, orbit-finite sets, ddc:004, Automata, semigroups

Popis souboru: application/pdf

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#BojanczykS20
https://drops.dagstuhl.de/opus/volltexte/2020/12520/pdf/LIPIcs-ICALP-2020-113.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12520/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.113

View record at OpenAIRE Nájsť tento článok vo Web of Science

Přidat do oblíbených

Uloženo v:
20

Models algebraics analítics del llenguatge. Un exemple: les gramàtiques contextuals; formalització i estudi de les seves aplicacions

Autoři: Miquel Vergés, Joan

Přispěvatelé: University/Department: Universitat Rovira i Virgili. Departament de Filologies Romàniques

Thesis Advisors: Martín Vide, Carlos

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Gramàtiques contextuals, Teoria de llenguatges formals, Modelització matemàtica, Gramáticas contextuales, Teoría de lenguajes formales, Modelización matemática, Contextual grammars, Formal language theory, Mathematical modelling, Arts i humanitats

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/694932

View record in TDX

Přidat do oblíbených

Uloženo v: